Abstract
A recent paper by Merle and Späth [3] gives some computational experience with two algorithms for linear discreteL p approximation. In this note, we establish a theoretical basis for some convergence properties observed by these authors.
Zusammenfassung
Merle und Späth [3] beschrieben 1974 numerische Erfahrungen mit zwei Algorithmen zur linearen diskretenL p Approximation. In der vorliegenden Arbeit wird eine theoretische Basis für einige Konvergenzeigenschaften gegeben, die von den Autoren beobachtet wurden.
This is a preview of subscription content, log in via an institution to check access.
References
Fletcher, R., Grant, J. A., Hebden, M. D.: The calculation of linear bestL p approximations. Computer J.14, 226–279 (1971).
Kahng, S. W.: BestL p approximation. Math. of Computation26, 505–508 (1972).
Merle, G., Späth, H.: Computational experience with discreteL p approximation. Computing12, 315–321 (1974).
Ortega, J. M., Rheinboldt, W. C.: Iterative Solution of Nonlinear Equations in Several Variables. New York-London: Academic Press 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Watson, G.A. On two methods for discreteL p approximation. Computing 18, 263–266 (1977). https://doi.org/10.1007/BF02253212
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02253212