On an algorithm for nonlinear minimax approximation
- 1 March 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 13 (3) , 160-162
- https://doi.org/10.1145/362052.362056
Abstract
Certain nonlinear minimax approximation problems are characterized by properties which permit the application of special algorithms, mainly based on the exchange algorithms of Remes (1934, 1935), for their solution. In this paper the application to problems of this type of a general nonlinear algorithm due to Osborne and Watson (1969) is considered. Examples are given to illustrate that this algorithm can give satisfactory results and, in particular, can successfully solve problems which lead to difficulties with the more conventional specialist method.Keywords
This publication has 4 references indexed in Scilit:
- Computational Aspects of Chebyshev Approximation Using a Generalized Weight FunctionSIAM Journal on Numerical Analysis, 1968
- On the Best Linear Chebyshev ApproximationThe Computer Journal, 1967
- Optimal starting values for Newton-Raphson calculation of √x ½Communications of the ACM, 1967
- Chebyshev Approximation Using a Generalized Weight FunctionSIAM Journal on Numerical Analysis, 1966