Two Simple Algorithms for Discrete Rational Approximation
- 1 October 1970
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 24 (112) , 877-891
- https://doi.org/10.2307/2004622
Abstract
This paper reports on computational experience with algorithms due to Loeb and Appel for rational approximation on discrete point sets. Following a brief review of the linear discrete approximation problem, the two rational algorithms are stated in a general setting. Finally, several numerical examples of applications to ${l_1}$, ${l_2}$, and ${l_\infty }$ approximation are supplied and discussed.
Keywords
This publication has 1 reference indexed in Scilit:
- Norms for Smoothing and EstimationSIAM Review, 1964