NUMERICAL METHODS

FOR ENGINEERS

PART 2
CHAPTER 7
ROOTS OF POLYNOMIALS

POLYNOMIALS IN ENGINEERING AND

SPACE
Polynomials have many applications in
engineering
and
science
like
characterizing dynamic systems and
in particular, linear systems.
Homogeneous solution- It is also
known as general solution of the
equation deals with the case when the
forcing function is set to zero.

COMPUTING WITH
POLYNOMIALS
Computing with polynomials requires
nth
times
of
addition
and
multiplication to be able to evaluate
the given polynomial.

POLYNOMIAL DEFLATION
Polynomial deflation It is a removal
process wherein you remove the
repeated root before proceeding to
another procedure.
Forward deflation It refers to the
case where the new polynomial
coefficients are in order of
descending powers of x.

 Backward deflation It is from the zeroorder to the highest-order term, it is

preferable to divide by the roots of the
largest absolute first.
Root polishing It is another way to
reduce round-off errors wherein you
consider each successive root estimate
obtained during deflation as a good first
guess.

CONVENTIONAL METHODS
There are different methods used for
solving roots of a function it can be
by using bracketing methods, open
methods and special methods. It
depends upon what method you will
use because problems arise when
encountering complex roots that
leads to divergence and deflation
thats why special methods are use
namely the Mullers method and

MULLERS METHOD
Mullers method This method
consists of deriving the coefficients
of the parabola that goes through the
three
points
and
takes
the
intersection of the x-axis with the
parabola for the next approximation.

FORMULAS FOR MULLERS METHOD

BAIRSTOW METHOD
Bairstow method It is a method
valid only for polynomials with real
coefficients. The Bairstow method
attempts to find the zeros of such
polynomials by searching pairs of
zeros which generate real quadratic
factors.

OTHER METHODS
Jenkins- Traub method is commonly
used in software libraries like IMSL.
The method is fairly complicated to
use.
Laguerres method- This method
approximates both real and complex
roots and cubic convergence.

JENKINS-TRAUB ALGORITHM
The algorithm starts by checking the
polynomial for the occurrence of very
large or very small roots. If necessary, the
coefficients are rescaled by a rescaling of
the variable. In the algorithm proper,
roots are found one by one and generally
in increasing size. After each root is found,
the polynomial is deflated by dividing off
the corresponding linear factor.