Lab 10 · Lecture 10 · Secant Method and Nonlinear Systems
Secant and Systems Lab
Race the root-finding methods, try the secant method on your own problems, and solve two equations with Newton's method.
All four methods on the same equation: log of the error against the iteration number. Straight lines are linear convergence; curves bending down are superlinear or quadratic.
Blue and green curves are f₁ = 0 and f₂ = 0; their crossings are the solutions. Change the starting point to reach a different solution.
Secant
Try this
All methods
Try this
Newton for systems
Try this
Q1 Derive the secant formula from Newton's formula.
Replace by in , giving .
Q2 Find the root of near 0.6 by the secant method with , .
, , , , , . Root ≈ 0.619061.
Q3 Distinguish the secant method from false position.
Both use the chord formula. False position keeps the pair of points that brackets the root (always converges, may stall); secant always uses the two latest points (no bracket, faster, may diverge).
Q4 Write the Newton iteration for the system , .
. Solve and set .
Q5 Which method would you choose, and why: (a) is a noisy measurement; (b) is a polynomial with an easy derivative and a good guess is known; (c) comes from a slow simulation with no derivative?
(a) Bisection: needs only signs, robust to noise. (b) Newton: quadratic, cheap. (c) Secant (or Brent): no derivative, one evaluation per step, superlinear.