Lecture 6.
Secant method, hybrid
method.
Today I introduced the secant algorithm
for determining roots of a function. We saw that the secant algorithm is a
variant of Newton's method that approximates the first derivative with a finite
difference. The secant method shares the same advantages and disadvantages as
Newton's algorithm.
We then saw
how we could combine the secant algorithm with the bisection algorithm to create
a hybrid approach for root finding. This hybrid has the advantage of the
bisections algorithms guaranteed convergence, and the potential of the scat
methods quick convergence.
Posted: Fri - September 23, 2005 at 01:54 PM