Numerical Analysis Advanced Topics in Root Finding - PowerPoint PPT Presentation

1 / 14
About This Presentation
Title:

Numerical Analysis Advanced Topics in Root Finding

Description:

Division of Electrical and Computer Engineering, Hanyang University ... Bracketing methods cannot cope with multiple roots. Open methods can find multiple roots ... – PowerPoint PPT presentation

Number of Views:151
Avg rating:3.0/5.0
Slides: 15
Provided by: jongi8
Category:

less

Transcript and Presenter's Notes

Title: Numerical Analysis Advanced Topics in Root Finding


1
Numerical Analysis- Advanced Topics in Root
Finding -
  • Hanyang University
  • Jong-Il Park

2
Summary Root Finding
3
Error analysis of N-R method
Taylor series
Newton-Raphson method
--- (1)
At the true solution xr
--- (2)
(1) ? (2)
Let
Quadratic convergence!
4
Error Analysis of Secant Method
  • Convergence Jeeves, 1958
  • More efficient than N-R method if the calculation
    of f(x) is complex
  • Modified secant method

5
Multiple roots
  • Bracketing methods cannot cope with multiple
    roots
  • Open methods can find multiple roots
  • But the speed is slow in many case
  • f(x)?0 will cause a problem(divide by zero)
  • f(x) will always reach zero before f(x)
    Ralston and Rabinowitz, 1978
  • ? if a zero check for f(x) is incorporated into
    the program, the computation can be terminated
    before f(x) reaches zero
  • Alternative way using u(x)f(x)/f(x)

6
Polynomial evaluation
  • Bad method
  • Worst method
  • Best method

C code
7
Polynomial differentiation
or
8
N-th derivatives
9
Polynomial deflation
  • Multiplication by (x-a)
  • Synthetic division by (x-a)

10
Bairstows method
  • Deflation method
  • Find r and s such that b0b10
  • Efficient routine using synthetic division exists
  • Good initial guess of r, s is important
  • Complex roots can be evaluated
  • Suitable for root polishing
  • In Numerical Recipes in C
  • void qroot()

11
Laguerre method
  • Deflation method
  • Algorithm derivation
  • In Numerical Recipes in C zroots() calls
    laguer()

12
Application of Root Finding Electric circuit
design(1/2)
  • Problem Find the proper R to dissipate energy to
    1 at a specified rate(t0.05s), given L5H,
    C10-4 F.
  • Solution

13
Application of Root Finding Electric circuit
design(2/2)
  • Reasonable initial range for R
  • 0lt R lt 400
  • To achieve r.e. of 10-4
  • Bisection method 21 iterations
  • Other methods ?
  • To achieve r.e. of 10-6
  • Bisection method ? iterations
  • Other methods ?
  • Homework

14
Homework 4
Due 10/5
  • Find the root of f(R)0 and the number of
    iterations when the r.e.10-4 and 10-6
    respectively.
  • Solve the problems 8-28, 31, 32
  • Explain the concept of pointer to function and
    describe how you use it in your homework 3.
Write a Comment
User Comments (0)
About PowerShow.com