# Newton's method

 related topics {math, number, function} {rate, high, increase} {island, water, area} {water, park, boat}

In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the zeroes (or roots) of a real-valued function. The algorithm is first in the class of Householder's methods, succeeded by Halley's method.

The Newton-Raphson method in one variable:

Given a function ƒ(x) and its derivative ƒ '(x), we begin with a first guess x0. Provided the function is reasonably well-behaved a better approximation x1 is

Geometrically, x1 is the intersection point of the tangent line to the graph of f, with the x-axis. The process is repeated until a sufficiently accurate value is reached:

## Contents

 related documents Integration by parts Functor Direct sum of modules Series (mathematics) Boolean satisfiability problem Riemann zeta function List of trigonometric identities Stone–Čech compactification Principal components analysis Johnston diagram Pascal's triangle Forcing (mathematics) Infinity Russell's paradox Complete lattice Cauchy sequence Groupoid Ruby (programming language) Denotational semantics Bra-ket notation Non-standard analysis Numerical analysis Mathematical induction Kernel (algebra) Cardinal number Sequence alignment Gaussian elimination Entropy (information theory) Huffman coding Addition