2.3: Secant Method
( \newcommand{\kernel}{\mathrm{null}\,}\)
The Secant Method is second best to Newton’s Method, and is used when a faster convergence than Bisection is desired, but it is too difficult or impossible to take an analytical derivative of the function f(x). We write in place of f′(xn),
f′(xn)≈f(xn)−f(xn−1)xn−xn−1
Starting the Secant Method requires a guess for both x0 and x1.
2.3.1. Estimate √2=1.41421356 using Newton’s Method
The √2 is the zero of the function f(x)=x2−2. To implement Newton’s Method, we use f′(x)=2x. Therefore, Newton’s Method is the iteration
xn+1=xn−x2n−22xn
We take as our initial guess x0=1. Then
x1=1−−12=32=1.5x2=32−94−23=1712=1.416667,x3=1712−172122−2176=577408=1.41426.
2.3.2. Example of fractals using Newton’s Method
Consider the complex roots of the equation f(z)=0, where
f(z)=z3−1
These roots are the three cubic roots of unity. With
ei2πn=1,n=0,1,2,…
the three unique cubic roots of unity are given by
1,ei2π/3,ei4π/3
With
eiθ=cosθ+isinθ,
and cos(2π/3)=−1/2,sin(2π/3)=√3/2, the three cubic roots of unity are
r1=1,r2=−12+√32i,r3=−12−√32i
The interesting idea here is to determine which initial values of z0 in the complex plane converge to which of the three cubic roots of unity.
Newton’s method is
zn+1=zn−z3n−13z2n
If the iteration converges to r1, we color z0 red; r2, blue; r3, green. The result will be shown in lecture.