3. Newton-Raphson Methods

Corollary 3.1 (Newton’s Iteration for Finding Square Roots). Assumes that A > 0 is a real number and let p0 > 0 be an initial approximation to Define the sequence using the recursive rule

for i = 1, 2, ... (3.2)

Then the sequence converges to , that is, =

Previous slide

Next slide

Back to first slide

View graphic version