Scribd
Upload
35 views32 pages

L5-Roots Finding (Polynomials)

The document discusses numerical methods for finding roots of polynomials, focusing on techniques such as Müller’s method and polynomial deflation. It emphasizes minimizing round-off errors during calculations and provides guidelines for estimating roots using both real and complex numbers. Examples are included to illustrate the application of these methods.

Uploaded by

İsmet Yıldırım
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views32 pages

L5-Roots Finding (Polynomials)

The document discusses numerical methods for finding roots of polynomials, focusing on techniques such as Müller’s method and polynomial deflation. It emphasizes minimizing round-off errors during calculations and provides guidelines for estimating roots using both real and complex numbers. Examples are included to illustrate the application of these methods.

Uploaded by

İsmet Yıldırım
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

MAT 202 E

NUMERICAL METHODS

Roots of Polynomials

“These notes are only to be used in class presentations”

Textbook: Numerical Methods for Engineers, S.C. Chapra, R.P. Canale,


7th edition, 2015
Requires
and

In constrast, a nested format

Requires n multiplications and n additions.

Nested format minimizes the number of operations, it


minimizes round-off errors.
Polynomial Deflation

• Suppose you find a single root of an nth order


polynomial. If you repeat the root finding, you may
get the same root.
• This can be avoided by removing the root.
• Divide the polynomial by the monomial defined by the
real root.
Polynomial Deflation

• Each calculated root is known only approximately so


deflation is sensitive to round-off error.

• How to minimize round-off errors?


Consider each successive root estimate obtained during
deflation as a good first-guess. These then can be used
as a starting guess, and the root determined again with
the original nondeflated polynomial (Root Polishing)
Finding roots of polynomial
• For real roots, you can use bracketing and open methods.

• For complex roots, bracketing methods can’t be used


because the criterion for defining a bracket (sign change)
doesn’t translate to complex guesses.

• Open methods can be used, with complex initial guesses


but convergence problems may occur.

• Special methods have been developed to find the real and


complex roots of polynomials.
• Müller’s method
• Bairstow’s method
Müller’s method

• It is similar to secant method.

• Secant method obtains a root estimate by projecting a


straight line to the x-axis through two function values.

• Instead of projecting a straight line through 2 points to


estimate the root, project a parabola through 3 points
to estimate the root.
Müller Method

• The method consists of deriving the coefficients of parabola that


goes through the three points:
These coefficients are then substituted into the quadratic formula
to obtain the point where the parabola intersects the x-axis.
It’s the root estimate.

1. Write the equation in a convenient form:

f ( x )  a ( x  x2 ) 2  b ( x  x2 )  c
2. The parabola should intersect the three points [xo, f(xo)], [x1, f(x1)], [x2, f(x2)].
The coefficients of the polynomial can be estimated by substituting three
points to give
f ( xo )  a ( xo  x2 ) 2  b( xo  x2 )  c
f ( x1 )  a( x1  x2 ) 2  b( x1  x2 )  c
f ( x2 )  a ( x2  x2 ) 2  b ( x2  x2 )  c

3. Three equations can be solved for three unknowns, a, b, c. Since two of the
terms in the 3rd equation are zero, it can be immediately solved for

c  f ( x2 )
f ( xo )  f ( x2 )  a ( xo  x2 ) 2  b( xo  x2 )
f ( x1 )  f ( x2 )  a ( x1  x2 ) 2  b( x1  x2 )
To solve for a and b, we define a number of differences:

h o  x1 - x o h1  x 2 - x1
f ( x1 )  f ( xo ) f ( x2 )  f ( x1 )
o  1 
x1  xo x2  x1
( ho  h1 )b  ( ho  h1 ) 2 a  ho o  h11
Solved for a
h1b  h12 a  h11 and b

1  o
a b  ah1  1 c  f ( x2 )
h1  ho
The intersection point with the x-axis is the root of the parabola
which we can find using the quadratic formula.
x3: root estimate
f ( x3 )  a ( x3  x 2 ) 2  b ( x 3  x 2 )  c  0
 b  b 2  4ac
x3  x 2 
2a
If b2  4ac the difference in the numerator can be very small,
This may increase round-off errors.
• Roots can be found by applying an alternative form of quadratic
formula:

 b  b 2  4ac  2c

2a b  b 2  4ac
 2c
x3  x 2 
b  b 2  4ac
• ±term yields two roots, the sign is chosen to agree with the sign of
b. This will result in a largest denominator, and will give root
estimate that is closest to x2.
Calculate b  b 2  4ac and b  b 2  4ac and choose the largest
• Once x3 is determined, the process is repeated using the
following guidelines:

1. If only real roots are being located, choose the two


original points that are nearest the new root estimate, x3.
2. If both real and complex roots are estimated, employ a
sequential approach just like in secant method, x1, x2, and
x3 to replace xo, x1, and x2.
• The proces is terminated when

xi 1  xi
a   s
x i 1

For complex values use magnitudes.


• If we don’t have 3 arbitrary points, we may use a small
perturbation fraction δ to determine the initial points such
as

x2
x1  x2  x1
x0  x2  x1
Example: Use Müller’s method with guesses of x0=4.5,
x1=5.5 and x2=5 to determine a root of the equation

f ( x )  x  13x  12
3

εs=10-5
x*=4
Example: Use Müller’s method to determine the roots of

f ( x)  2 x  6 x  8
3

with x2=0.8 and δ=0.01

εs=10-5
Complex roots found in conjugate pairs
xr1  0.5  j1.9365 , xr 2  0.5  j1.9365
( x  (0.5  j1.9365))( x  (0.5  j1.9365))  x 2  x  4

f ( x )  2 x 3  6 x  8  0  f ( x )  x 3  3x  4  0
x 1
x 2  x  4 x 3  0 x 2  3x  4 xr 3  1

x3  x2  4 x
x2  x  4
x2  x  4
0

You might also like