Linear Chebyshev approximation without Chebyshev sets
From MaRDI portal
Publication:4122692
DOI10.1007/BF01932717zbMath0352.65009OpenAlexW1993379913MaRDI QIDQ4122692
D. O. Andreassen, G. Alistair Watson
Publication date: 1976
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932717
Related Items (5)
An interior semi-infinite programming method ⋮ A New Method for Chebyshev Approximation of Complex-Valued Functions ⋮ The discrete linear restricted Chebyshev approximation ⋮ Nonlinear Chebyshev approximation subject to constraints ⋮ Approximation in normed linear spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some Chebyshev approximations by polynomials in two variables
- A descent algorithm for linear continuous Chebyshev approximation
- On Haar's Theorem Concerning Chebychev Approximation Problems Having Unique Solutions
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- Numerical treatment of a class of semi‐infinite programming problems
- Approximations in $L^p $ and Chebyshev Approximations
- On the Best Linear Chebyshev Approximation
- A Survey of Practical Rational and Polynomial Approximation of Functions
This page was built for publication: Linear Chebyshev approximation without Chebyshev sets