Lecture 6.
Newton's
Method.
Newton's method
finds a zero of a function f starting with a single guess. The rate of
convergence of Newton's method is usually quicker than the bisection algorithm,
however, if we guess badly, then Newton's method may not converge at all.
I systematically covered the
following topics related to Newton's method:
• geometric
description
• termination
conditions
• Taylor series
derivation
• rate of
convergence
Just before we left
I spoke about the secant algorithm, presenting an informal description of the
algorithm and how it is related to Newton's
method.
Posted: Fri - September 22, 2006 at 01:01 PM