Abstract
When the nonlinear approximation problem is treated by using Newton's method, at each iteration step the solution of a linear approximation problem is required. If we are concerned with nonlinear Chebyshev approximation, the (linear) auxiliary problem is also non trivial. Thus for generating a more effective algorithm the latter problem is solved only on a finite point set. However, then we must not only choose reference points like in Remez-type algorithmus; the reference set has to be augmented in order to take care of numerical stability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
R.B. Barrar and H.L. Loeb, On the Remez Algorithm for non-linear families. Numer. Math. 15, 382–391 (1970)
A. Baumann, Die Konstruktion bester Tschebyscheff-Approximationen mit Splines bei freien Knoten. Schriftenreihe des Rechenzentrums der Universität Münster Nr. 11 (1974)
D. Braess, Die Konstruktion der Tschebyscheff-Approximierenden bei der Anpassung mit Exponentialsummen. J.Approximation Theory 3, 261–273 (1970)
—, Kritische Punkte bei der nichtlinearen Tschebyscheff Approximation. Math. Z. 132, 327–341 (1973)
—, Eine Möglichkeit zur Konvergenzbeschleunigung bei Iterationsverfahren für bestimmte nichtlineare Probleme. Numer. Math. 14, 468–475 (1970)
—, Chebyshev approximation by γ-polynomials III. (in preparation)
L. Cromme, Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen. Numer. Math. 25, 447–459 (1976)
W. Krabs, Ein Verfahren zur Lösung gewisser nichtlinearer diskreter Approximationsprobleme. ZAMM 50, 359–368 (1970)
C.M. Lee and F.D.K. Roberts, A comparison of algorithms for rational ℓ∞-approximation. Math. Comp. 27, 111–121 (1973)
M.R. Osborne and G.A. Watson, An algorithm for minimax approximation in the nonlinear case. Comp.J. 12, 63–68 (1969)
H. Werner, Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen. Arch. Rational Mech. Anal. 11, 368–384 (1962)
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Braess, D. (1976). Zur numerischen Stabilität des Newton-Verfahrens bei der nichtlinearen Tschebyscheff-Approximation. In: Schaback, R., Scherer, K. (eds) Approximation Theory. Lecture Notes in Mathematics, vol 556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0087396
Download citation
DOI: https://doi.org/10.1007/BFb0087396
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08001-5
Online ISBN: 978-3-540-37552-4
eBook Packages: Springer Book Archive