Skip to main content
SpringerLink
Log in

Convergence Acceleration for Some Rootfinding Methods

  • Chapter
Validation Numerics

Part of the book series: Computing Supplementum ((COMPUTING,volume 9))

Abstract

Convergence Acceleration for Some Rootfinding Methods. We present simple, efficient extrapolation formulas to accelerate the convergence of super-linearly convergent sequences. Applications are given for some rootfinding methods such as Newton’s method and the secant method. Numerical examples are given showing the effectiveness of the extrapolation formulas.

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
Softcover Book
USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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

  1. Atkinson, K. E.: An introduction to numerical analysis, 2nd ed. New York: John Wiley & Sons 1988.

    Google Scholar 

  2. Brezinski, C.: Acceleration de la Convergence en Analyse Numerique. Berlin: Springer 1977 (Lecture Notes in Mathematics, 584).

    MATH  Google Scholar 

  3. Joyce, D. C.: Survey of extrapolation processes in numerical analysis. SIAM Review 13 435 – 488 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  4. Meinardus, G.: Über das asymptotische Verhalten von Iterationsfolgen. Z. Ang. Math. Mech. 63, 70– 72(1983).

    Article  MathSciNet  MATH  Google Scholar 

  5. Potra, F. A.: On an iterative algorithm of order 1.839for solving nonlinear operator equations. Numer. Funct. Anal, and Optimiz. 7, 75–106 (1984–85).

    Article  MathSciNet  Google Scholar 

  6. Potra, F. A.: On Q-order and R-order of convergence. J. Optimization Theory and Applications 63, 415 – 431 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  7. Traub, J.: Iterative methods for the Solution of equations. New Jersey: Prentice-Hall, Englewood Cliffs 1964.

    Google Scholar 

  8. Walz, G.: Approximation von Funktionen durch asymptotische Entwicklungen und Eliminationsprozeduren. Dissertation, Universität Mannheim, 1987.

    Google Scholar 

  9. Walz, G.: Asymptotic expansion and acceleration of convergence for higher order iteration process. Numer. Math. 59, 529 – 540 (1991).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Iowa, Iowa City, IA, 52242, USA

    Weimin Han & F. A. Potra

Authors
  1. Weimin Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. A. Potra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Innsbruck, Austria

    R. Albrecht

  2. Institut für Angewandte Mathematik, Universität Karlsruhe, Federal Republic of Germany

    G. Alefeld

  3. Institut für Angewandte und Numerische Mathematik, Technische Universität Wien, Austria

    H. J. Stetter

Additional information

Dedicated to Professor U. Kulisch on the occasion of his 60th birthday

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag

About this chapter

Cite this chapter

Han, W., Potra, F.A. (1993). Convergence Acceleration for Some Rootfinding Methods. In: Albrecht, R., Alefeld, G., Stetter, H.J. (eds) Validation Numerics. Computing Supplementum, vol 9. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6918-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6918-6_6

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82451-1

  • Online ISBN: 978-3-7091-6918-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation