newton-raphson iteration

Computing Dictionary

Newton-Raphson iteration definition

An iterative algorithm for solving equations. Given an equation,
f x = 0
and an initial approximation, x(0), a better approximation is given by:
x(i+1) = x(i) - f(x(i)) / f'(x(i))
where f'(x) is the first derivative of f, df/dx.
Newton-Raphson iteration is an example of an anytime algorithm in that each approximation is no worse than the previous one.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: newton-method
Next Definition: newton-rings
More from
Synonyms and Antonyms for Newton-Raphson iteration
More from
Search for articles containing Newton-Raphson iteration Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature