Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Best $ L\sb{p}$ approximation


Author: S. W. Kahng
Journal: Math. Comp. 26 (1972), 505-508
MSC: Primary 65D15
DOI: https://doi.org/10.1090/S0025-5718-1972-0309270-2
MathSciNet review: 0309270
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A new algorithm is presented for the best $ {L_p}$ approximation of a continuous function over a discrete set or a finite interval with $ 2 < p < \infty $. Methods to accelerate the convergence of the Rice-Usow extension of Lawson's algorithm as well as the new algorithm are presented, and the result of a numerical example is given.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D15

Retrieve articles in all journals with MSC: 65D15


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1972-0309270-2
Keywords: Polynomial approximation, Newton-Raphson method
Article copyright: © Copyright 1972 American Mathematical Society