Bernoulli, Quotient-Difference, and Integral Methods
J.M. McNamee and V.Y. Pan
Abstract
This chapter treats several topics, starting with Bernoulli’s method. This method iteratively solves a linear difference equation whose coefficients are the same as those of the polynomial. The ratios of successive iterates tends to the root of largest magnitude. Special versions are used for complex and/or multiple roots. The iteration may be accelerated, and Aitken’s variation finds all the roots simultaneously.
The Quotient-Difference algorithm uses two sequences
(with a similar one for ). Then, if the roots are well separated, . Special techniques ...
Get Numerical Methods for Roots of Polynomials - Part II now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
