Skip to main content
SpringerLink
Log in

Finding Zeros and Minimum Points by Iterative Methods

  • Chapter
Introduction to Numerical Analysis

Part of the book series: Texts in Applied Mathematics ((TAM,volume 12))

  • 745 Accesses

Abstract

Finding the zeros of a given function f, that is arguments ξ for which f(ξ)= 0, is a classical problem. In particular, determining the zeros of a polynomial (the zeros of a polynomial are also known as its roots)

$$ p\left( x \right) = {a_0} + {a_1}x + \cdots + {a_n}{x^n} $$

has captured the attention of pure and applied mathematicians for centuries. However, much more general problems can be formulated in terms of finding zeros, depending upon the definition of the function f: E → F, its domain E, and its range F.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References for Chapter 5

  • Baptist, P., Stoer, J.: On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications. Numer. Math 28, 367–391 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  • Bauer, F. L.: Beiträge zur Entwicklung numerischer Verfahren für programmgesteuerte Rechenanlagen. II. Direkte Faktorisierung eines Polynoms. Bayer. Akad. Wiss. Math. Natur. Kl. S.B 163–203 (1956).

    Google Scholar 

  • Brent, R. P.: Algorithms for Minimization without Derivatives. Englewood Cliffs, N.J.: Prentice-Hall 1973.

    MATH  Google Scholar 

  • Broyden, C. G.: A class of methods for solving nonlinear simultaneous equations. Math. Comput 19, 577–593 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  • Broyden, C. G.: Quasi-Newton-methods and their application to function minimization. Math. Comput 21, 368–381 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  • Broyden, C. G.: The convergence of a class of double rank minimization algorithms. 2. The new algorithm. J. Inst. Math. Appl 6, 222–231 (1970).

    Article  MathSciNet  MATH  Google Scholar 

  • Broyden, C. G.: Dennis, J. E., Moré, J. J.: On the local and superlinear convergence of quasi-Newton methods. J. Inst. Math. Appl 12, 223–245 (1973).

    MathSciNet  MATH  Google Scholar 

  • Collatz, L.: Funktionalanalysis und numerische Mathematik. Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen. Bd. 120. Berlin, Heidelberg, New York: Springer 1968. English edition: Functional Analysis and Numerical Analysis. New York: Academic Press 1966.

    Google Scholar 

  • Davidon, W. C.: Variable metric methods for minimization. Argonne National Laboratory Report ANL-5990, 1959.

    Google Scholar 

  • Davidon, W. C.: Optimally conditioned optimization algorithms without line searches. Math. Programming 9, 1–30 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  • Deuflhard, P.: A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with applications to multiple shooting. Numer. Math 22, 289–315 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Google Scholar 

  • Edited by F. A. Lootsma. 149–170. New York: Academic Press 1971. Fletcher, R., Powell, M. J. D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163–168 (1963).

    Google Scholar 

  • Gill, P. E., Golub, G. H., Murray, W., Saunders, M. A.: Methods for modifying matrix factorizations. Math. Comput 28, 505–535 (1974).

    Google Scholar 

  • Henrici, P.: Applied and Computational Complex Analysis. Vol. 1. New York: Wiley 1974.

    MATH  Google Scholar 

  • Himmelblau, D. M.: Applied Nonlinear Programming. New York: McGraw-Hill 1972.

    MATH  Google Scholar 

  • Householder, A. S.: The Numerical Treatment of a Single Non-linear Equation. New York: McGraw-Hill 1970.

    Google Scholar 

  • Jenkins, M. A., Traub, J. F.: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numer. Math 14, 252–263 (1970).

    Article  MathSciNet  MATH  Google Scholar 

  • Luenberger, D. G.: Introduction to Linear and Nonlinear Programming. Reading, Mass.: Addison-Wesley 1973.

    MATH  Google Scholar 

  • Maehly, H.: Zur iterativen Auflösung algebraischer Gleichungen. Z. Angew. Math. Physik 5, 260–263 (1954).

    Article  MathSciNet  MATH  Google Scholar 

  • Marden, M.: Geometry of Polynomials. Providence, R.I.: Amer. Math. Soc. 1966. Nickel, K.: Die numerische Berechnung der Wurzeln eines Polynoms. Numer. Math 9, 80–98 (1966).

    Google Scholar 

  • Oren, S. S., Luenberger, D. G.: Self-scaling variable metric (SSVM) algorithms. I. Criteria and sufficient conditions for scaling a class of algorithms. Manage. Sci 20, 845–862 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  • Oren, S. S., Luenberger, D. G., Spedicato, E.: Optimal conditioning of self-scaling variable metric algorithms. Stanford University Dept. of Engineering, Economic Systems Report ARG-MR 74–5, 1974.

    Google Scholar 

  • Ortega, J. M., Rheinboldt, W. C.: Iterative Solution of Non-linear Equations in Several Variables. New York: Academic Press 1970.

    Google Scholar 

  • Ostrowski, A. M.: Solution of Equations in Euclidean and Banach Spaces. New York: Academic Press 1973.

    MATH  Google Scholar 

  • Peters, G., Wilkinson, J. H.: Eigenvalues of Ax = a.Bx with band symmetric A and B. Comput. J. 12, 398–404 (1969).

    Article  MathSciNet  MATH  Google Scholar 

  • Peters, G., Practical problems arising in the solution of polynomial equations. J. Inst. Math. Appl 8, 16–35 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  • Powell, M. J. D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Proc. AMS Symposium on Nonlinear Programming 1975. Amer. Math. Soc. 1976.

    Google Scholar 

  • Stoer, J.: On the convergence rate of imperfect minimization algorithms in Broyden’s ß-class. Math. Programming 9, 313–335 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  • Stoer, J.: On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory. Numer. Math 28, 343–366 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  • Tornheim, L.: Convergence of multipoint methods. J. Assoc. Comput. Mach 11, 210–220 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  • Traub, J. F.: Iterative Methods for the Solution of Equations. Englewood Cliffs, N.J.: Prentice-Hall 1964.

    MATH  Google Scholar 

  • Wilkinson, J. H.: The evaluation of the zeros of ill-conditioned polynomials. Part I. Numer. Math 1, 150–180 (1959).

    Article  MathSciNet  Google Scholar 

  • Wilkinson, J. H.: Rounding Errors in Algebraic Processes. Englewood Cliffs, N.J.: PrenticeHall 1963.

    MATH  Google Scholar 

  • Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Oxford: Clarendon Press 1965.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Mathematik, Universität Würzburg, am Hubland, 8700, Würzburg, Germany

    J. Stoer

  2. Institut für Mathematik, Technische Universität, 8000, München, Germany

    R. Bulirsch

Authors
  1. J. Stoer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Bulirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Stoer, J., Bulirsch, R. (1993). Finding Zeros and Minimum Points by Iterative Methods. In: Introduction to Numerical Analysis. Texts in Applied Mathematics, vol 12. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2272-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2272-7_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-2274-1

  • Online ISBN: 978-1-4757-2272-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation