Numerical Methods for Roots of Polynomials - Part II: Introduction
The zeros of a polynomial can be readily recovered from its linear factors.
We consider proofs that every polynomial has one zero (and hence n) in the complex plane.
First we consider the Jenkins–Traub 3-stage algorithm.
This chapter treats several topics, starting with Bernoulli’s method.
In considering the stability of mechanical systems we are led to the characteristic equation .
We deal here with low-degree polynomials, mostly closed-form solutions.
We discuss the secant method:where are initial guesses.
Whereas Newton’s method involves only the first derivative, methods discussed in this chapter involve the second or higher.
We discuss Graeffes’s method and variations.