Skip to main content

An Improved Newton Iteration for Calculating Roots which is Optimal

  • Chapter
Numerische Methoden der Approximationstheorie

Abstract

In this paper we use techniques of approximation theory to show that a recently suggested improved Newton iteration for calculating roots is optimal.

Supported in Part by NSF Grant GP-12088

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
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. Cody, W. J.: Double-precision square root for the CDC-3600, Comm. ACM, 7 (1964), 715–718.

    Article  Google Scholar 

  2. King, R. F.: Improved Newton iteration for integral roots. Math. Comp. 25 (1971), 299-

    Article  Google Scholar 

  3. King, R. F. and D. L. Phillips: The logarithmic error and Newton’s method for the square root. Comm. ACM 12 (1969), 87–88.

    Article  Google Scholar 

  4. Loeb, H. L., D. G. Moursund and G. D. Taylor: Uniform rational weighted approximations having restricted ranges. J. Approx. Theory, 1 (1968), 401–411.

    Article  Google Scholar 

  5. Moursund, D. G.: Optimal starting values for Newton-Raphson calculation of √x. Comm. ACM 10 (1967), 430–432.

    Article  Google Scholar 

  6. Moursund, D. G.: Computational aspects of Chebyshev approximation using a generalized weight function. SIAM J. Numer. Anal. 5 (1968), 126–137.

    Article  Google Scholar 

  7. Moursund, D. G. and G. D. Taylor: Optimal starting values for the Newton-Raphson calculation of inverses of certain function. SIAM J. Numer. Anal., 5 (1968), 138–150.

    Article  Google Scholar 

  8. Ninomiya, I.: Best rational starting approximations and improved Newton iteration for square root. Math. Comp. 24 (1970), 391–404.

    Article  Google Scholar 

  9. Phillips, D. L.: Generalized logarithmic error and Newton’s method for the m-th root. Math. Comp. 24 (1970), 383–389.

    Google Scholar 

  10. Sterbenz, P. H. and C. T. Fike: Optimal starting approximations for Newton’s method. Math. Comp. 23 (1969), 313–318.

    Article  Google Scholar 

  11. Taylor, G. D.: Optimal starting approximations for Newton’s Method. J. Approx. Theory 3 (1970), 156–163.

    Article  Google Scholar 

  12. Taylor, G. D.: An optimal improved Newton iteration for calculating roots. Michigan State University Tec. Rep., 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1972 Springer Basel AG

About this chapter

Cite this chapter

Taylor, G.D. (1972). An Improved Newton Iteration for Calculating Roots which is Optimal. In: Collatz, L., Meinardus, G. (eds) Numerische Methoden der Approximationstheorie. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’Analyse Numérique, vol 16. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5952-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-5952-3_19

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-5953-0

  • Online ISBN: 978-3-0348-5952-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics