Abstract
In this paper a modification of L. Wittmeyer’s method ([1], [14]) for rational discrete least squares approximation is given which corrects for its failure to converge to a non-optimal point in general. The modification makes necessary very little additional computing effort only. It is analysed thoroughly with respect to its conditions for convergence and its numerical properties. A suitable implementation is shown to be benign in the sense of F. L. Bauer [2]. The algorithm has proven successful even in adverse situations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barrodale, I.; Mason, J. C.: Two Simple Algorithms For Discrete Rational Aprroximation. Math. Comp. 24, (1970), 877–891
Bauer, F. L.: Numerische Abschätzung und Berechnung von Eigenwerten nichtsymmetrischer Matrizen. Aplikace Matematiky 10, (1965), 178–189
Björck, Å.: Iterative Refinement Of Linear Least Squares Solutions I. BIT 7, (1967), 257–278
Björck, Å.; Golub, G. H.: Iterative Refiniment Of Linear Least Squares Solutions By Householder Transformation. BIT7, (1967), 322–337
Braun, B.: Nichtlineare Gauß-Approximation, Lösungsverfahren und Kondition, mit Anwendung auf Exponential Summenapproximation. Doctoral Thesis, Mainz 1967
Collatz, L.: Funktionalanalysis und Numerische Mathematik. Berlin-Göttingen-Heidelberg: Springer 1964
Dunham, C. B.: Nonlinear Mean Square Approximation On Finite Sets. SIAM J. Numer. Anal. 12, (1975), 105–110
Householder, A. S.: The Theory Of Matrices In Numerical Analysis. New York: Blaisdell 1964
Ortega, J.; Rheinboldt, W. C.: Iterative Solution Of Nonlinear Equations In Several Variables. New York: Academic Press 1970
Pereyra, V.: Iterative Methods For Solving Nonlinear Least Squares Problems. SIAM J. Numer. Anal. 4 (1967), 27–36
Pomentale, T.: On Rational Discrete Least Squares Approximation. Num. Math. 12, (1968), 40–46
Spellucci, P.: Einige neue Ergebnisse auf dem Gebiet der diskreten rationalen Approximation. Doctoral Thesis, Ulm 1972
Spellucci, P.: Algorithms For Rational Discrete Least Squares Approximation. Part II: Optimal Polefree Solution. In: Optimization and Optimal Control (Bulirsch, R., Oettli, W., Stoer, J.:eds.). Berlin-Heidelberg-New York: Springer 1975 (Lecture Notes on Mathematics 477)
Wittmeyer, L.: Rational Approximation To Empirical Functions. BIT 2, (1962), 53–60
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer Basel AG
About this chapter
Cite this chapter
Spellucci, P. (1976). Algorithms for Rational Discrete Least Squares Approximation Part I: Unconstrained Optimization. In: Albrecht, J., Collatz, L. (eds) Moderne Methoden der Numerischen Mathematik. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’Analyse Numérique, vol 32. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5501-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-0348-5501-3_10
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-0854-4
Online ISBN: 978-3-0348-5501-3
eBook Packages: Springer Book Archive