Open Access
Translator Disclaimer
May 2007 Implementing Newton's Method
Kent M. Neuerburg
Missouri J. Math. Sci. 19(2): 131-140 (May 2007). DOI: 10.35834/mjms/1316092492

Abstract

Newton's Method, the recursive algorithm for computing the roots of an equation, is one of the most efficient and best known numerical techniques. The basics of the method are taught in any first-year calculus course. However, in most cases the two most important questions are often left unanswered. These questions are, "Where do I start?" and "When do I stop?" We give criteria for determining when a given value is a good starting value and how many iterations it will take to ensure that we have reached an approximate solution to within any predetermined accuracy.

Citation

Download Citation

Kent M. Neuerburg. "Implementing Newton's Method." Missouri J. Math. Sci. 19 (2) 131 - 140, May 2007. https://doi.org/10.35834/mjms/1316092492

Information

Published: May 2007
First available in Project Euclid: 15 September 2011

zbMATH: 1177.65071
Digital Object Identifier: 10.35834/mjms/1316092492

Subjects:
Primary: 68W25
Secondary: 97D80

Rights: Copyright © 2007 Central Missouri State University, Department of Mathematics and Computer Science

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.19 • No. 2 • May 2007
Back to Top