The Computational Structure and Characterization of Nonlinear Discrete Chebyshev Problems

Thumbnail Image
Files
88-956.pdf (2.54 MB)
88-956.ps (499.42 KB)
No Access Until
Permanent Link(s)
https://hdl.handle.net/1813/6796
Collections
Computer Science Technical Reports
Other Titles
Authors
Abstract
We present the generalisation of some concepts in linear Chebyshev theory to the nonlinear case. We feel these generalisations capture the inherent structure and characteristics of the best Chebyshev approximation and that they can be usefully exploited in the computation of a solution to the discrete Chebyshev problem.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1988-12
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-956
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report
Accessibility Feature
Accessibility Hazard
Accessibility Summary
Link(s) to Catalog Record