Zusammenfassung
Ein wichtiges Problem ist die Bestimmung der Nullstellen ξ einer gegebenen Funktion f: f (ξ) = 0. Man denke dabei nicht nur an das Problem, die Nullstellen eines Polynoms
zu finden. Je nach Definition der Funktion f: E → F und der Mengen E und F kann man sehr allgemeine Probleme als eine Aufgabe der Nullstellenbestimmung auffassen. Ist z. B. E = F = ℝn so wird eine Abbildung f : ℝn → ℝn durch n reelle Funktionen f i (x l,..., x n) von n reellen Variablen x 1,..., x n beschrieben1:
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 zu Kapitel 5
Bauer, F. L.: Beiträge zur Entwicklung numerischer Verfahren für programmgesteuerte Rechenanlagen. II. Direkte Faktorisierung eines Polynoms. Bayer Akad. Wiss. Math. Nat. Kl. S.B. 163–203 (1956).
Collatz, L.: Funktionalanalysis und numerische Mathematik. Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen. Bd. 120. Berlin-HeidelbergNew York: Springer 1968.
Householder, A. S.: The Numerical treatment of a single non-linear equation. New York: McGraw-Hill 1970.
Jenkins, M. A., Traub, J. F.: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Num. Math. 14, 252–263 (1970).
Nickel, K.: Die numerische Berechnung der Wurzeln eines Polynoms. Num Math. 9, 80–98 (1966).
Marden, M.: Geometry of polynomials. Providence, Rhode Island: Amer. Math. Soc. 1966.
Ortega, J. M., Rheinboldt, W. C.: Iterative solution of non-linear equations in several variables. Computer science and applied mathematics. New York-London: Academic Press 1970.
Ostrowski, A. M.: Solution of equations in Euclidean and Banach spaces. New York-London: Academic Press 1973.
Peters, G., Wilkinson, J. H.: Eigenvalues of Ax =)Bx with band symmetric A and B. Comput. J. 12, 398–404 (1969).
Peters, G., Wilkinson, J. H.: Practical problems arising in the solution of polynomial equations. J. Inst. Math. Appl. 8, 16–35 (1971).
Traub, J. F.: Iterative methods for the solution of equations. Englewood Cliffs, N.J.: Prentice Hall 1964.
Wilkinson, J. H.: Rundungsfehler, Deutsche Übersetzung: Heidelberger Taschenbücher, Bd. 44. Berlin-Heidelberg-New York: Springer 1969.
Blum, E., Oettli, W.: Mathematische Optimierung. Berlin-Heidelberg-New York: Springer 1975.
Broyden, C. G.: A class of methods for solving nonlinear simultaneous equations. Math. Comp. 19, 577–593 (1965).
Broyden, C. G.: Quasi-Newton-methods and their application to function minimization. Math. Comp. 21, 368–381 (1967).
Broyden, C. G.: The convergence of a class of double rank minimization algorithms 2. The new algorithm. J. Inst. Maths. Applies. 6, 222–231 (1970).
Broyden, C. G., Dennis, J. E., Moré, J. J.: On the local and superlinear convergence of quasi-Newton methods. J. Inst. Maths. Applies. 12, 223–245 (1973).
Collatz, L., Wetterling, W.: Optimierungsaufgaben. Berlin-Heidelberg-New York: Springer 1971.
Davidon, W. C.: Variable metric methods for minimization. Argonne National Laboratory Report ANL-5990 (1959).
Davidon, W. C.: Optimally conditioned optimization algorithms without line searches. Math. Programming 9, 1–30 (1975).
Deufihard, P.: A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shooting. Numer. Math. 22, 289–315 (1974).
Dixon, L. C. W.: The choice of step length, a crucial factor in the performance of variable metric algorithms. In: Numerical methods for nonlinear optimization (F. A. Lootsma, ed.), 149–170. New York: Academic Press 1971.
Fletcher, R Powell, M. J. D.: A rapidly convergent descent method for minimization. Comp. J. 6 163–168 (1963).
algorithms I: Criteria and sufficient conditions for scaling a class of algorithms. Man. Sci. 20, 845–862 (1974).
Oren, S. S., Spedicato, E.: Optimal conditioning of self-scaling variable metric algorithms. Dept. of Engineering Economic Systems Report ARG-MR 74–5, Stanford University 1974.
Powell, M. J. D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. Proc. AMS Symposium on Nonlinear Programming, New York 1975.
Stoer, J.: On the convergence rate of imperfect minimization algorithms in Broyden’s ß-class. Math. Programming 9, 313–335 (1975).
Stoer, J.: On the relation between quadratic termination and convergence properties of minimization algorithms. Computer Sci. Dept. Report Stan-CS-75–516, Stanford, 1975.
Brent, R. P.: Algorithms for minimization without derivatives. Englewood Cliffs, N.J.: Prentice Hall 1973.
Henrici, P.: Applied and computational complex analysis, Vol. 1. New York: Wiley 1974.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stoer, J. (1989). Nullstellenbestimmung durch Iterationsverfahren. Minimierungsverfahren. In: Numerische Mathematik 1. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09024-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-09024-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51481-7
Online ISBN: 978-3-662-09024-4
eBook Packages: Springer Book Archive