Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- 1 March 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 11 (1) , 123-136
- https://doi.org/10.1137/0711013
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Bound on the Difference between the Chebyshev Norm and the Hölder Norms of a FunctionSIAM Journal on Numerical Analysis, 1971
- The calculation of linear best Lp approximationsThe Computer Journal, 1971
- Approximation of normsJournal of Approximation Theory, 1970
- A Survey of Practical Rational and Polynomial Approximation of FunctionsSIAM Review, 1970
- The Lawson algorithm and extensionsMathematics of Computation, 1968
- Necessary Conditions for a Minimax ApproximationThe Computer Journal, 1966
- Best approximation with respect to nearby normsNumerische Mathematik, 1964
- Approximations in $L^p $ and Chebyshev ApproximationsJournal of the Society for Industrial and Applied Mathematics, 1963
- Tchebycheff approximation in several variablesTransactions of the American Mathematical Society, 1963
- On the “Best” and “Least Q th” Approximation of an Overdetermined System of Linear EquationsJournal of the ACM, 1957