Example: bisection iteration... Convergence of FPI... Convergence of Newton’s method... Inverse quadratic interpolation... Safeguarded methods Rapidly convergent methods for solving non
Trang 1MATH 685/ CSI 700/ OR 682
Lecture Notes
Lecture 8 Nonlinear equations
Trang 3Example
Trang 4Existence/uniqueness
Trang 5Examples in 1d
Trang 6Example of a system in 2d
Trang 7Multiplicity
Trang 8Sensitivity and conditioning
Trang 9Sensitivity and conditioning
Trang 10Sensitivity and conditioning
Trang 11Convergence rate
Trang 12Convergence rate
Trang 13Bisection method
Trang 14Example: bisection iteration
Trang 15Bisection method
Trang 16Fixed-point iterations
Trang 17Examples
Trang 18Example: fixed point problems
Trang 19Examples: FPI
Trang 20Example: FPI
Trang 21Convergence of FPI
Trang 22Newton’s method
Trang 23Newton’s method
Trang 24Newton’s method
Trang 25Convergence of Newton’s method
Trang 26Newton’s method
Trang 27Secant method
Trang 28Secant method
Trang 29Example
Trang 30Higher-degree interpolation
Trang 31Inverse interpolation
Trang 32Inverse quadratic interpolation
Trang 33Example
Trang 34Linear fractional interpolation
Trang 35Example
Trang 36Safeguarded methods
Rapidly convergent methods for solving nonlinear equations may not converge unless started close to solution, but safe methods are slow
Hybrid methods combine features of both types of methods to achieve both speed and reliability
Use rapidly convergent method, but maintain bracket around
solution
If next approximate solution given by fast method falls outside bracketing interval, perform one iteration of safe method, such as bisection
Fast method can then be tried again on smaller interval with
greater chance of success
Ultimately, convergence rate of fast method should prevail
Hybrid approach seldom does worse than safe method, and
usually does much better
Popular combination is bisection and inverse quadratic
interpolation, for which no derivatives required
Trang 37Zeros of polynomials
Trang 38Systems of nonlinear
equations
Solving systems of nonlinear equations is much more difficult than scalar case because:
existence and number of solutions or good starting guess is much more complex
convergence to desired solution or to bracket
solution to produce absolutely safe method
dimension of problem
Trang 39Fixed-point iteration (FPI)
Trang 40Newton’s method
Trang 41Example
Trang 42Example
Trang 43Convergence of Newton’s method
Trang 44Cost of Newton’s method
Trang 45Secant updating methods
Trang 46Broyden’s method
Trang 47Broyden’s method
Trang 48Example
Trang 49Example
Trang 50Example
Trang 51Example (cont)
Trang 52Robust Newton-like methods
Trang 53Trust-region methods