Abstract
An algorithm for rational L1 approximation on an interval is obtained by adapting Loeb's weighted minimax algorithm for rational Chebyshev approximation on an interval. Sufficient conditions for the algorithm to fail are given.
Zusammenfassung
Entwickelt wird ein Algorithmus für rationelle L1-Annäherungen an einem Intervall durch Anpassung des Loebschen gewogenen Minimax-Algorithmus für rationale Chebyshev-Annäherungen an einem Intervall. Hinreichende Bedingungen für das Versagen des Algorithmus werden gegeben.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barrodale, I., Mason, J. C.: Two simple algorithms for discrete rational approximation, Technical Report No. 15, Computer Science Department, University of Toronto. Also appeared as Report No. 29, Departments of Mathematics, University of Victoria and in Math. Comp.24, 877–891 (1970).
Cheney, E. W., Goldstein, A. A.: Mean-square approximation by generalized rational functions. Math. Zeitschr.95, 232–241 (1967).
Dunham, C. B.: Degeneracy in mean rational approximation. J. Approx. Theory4, 235–239 (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dunham, C.B. Failure of Loeb's method for rational L1 approximation. Computing 13, 235–237 (1974). https://doi.org/10.1007/BF02241716
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02241716