Overview

Newton–Raphson method


Show Summary Details

Quick Reference

An algorithmic method for constructing a sequence of approximations to a root of an equation. Suppose it is desired to solve the equation f(x)=0 and that x1 is an approximate value for the root of the equation. If we write f′(xn) for the value of the derivative of f(x) (with respect to x) evaluated at the point x=xn, the sequence defined by usually converges to a root of the equation. It is based on constructing the tangent to the curve y=f(x) at the point (xn, f(xn), and taking xn+1 to be the x-coordinate of the point where this tangent cuts the x-axis.

Subjects: Probability and Statistics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.