Numerical Methods for Roots of Polynomials , Part 2Numerical Methods for Roots of Polynomials  Part II along with Part I (9780444527295) covers most of the traditional methods for polynomial rootfinding such as interpolation and methods due to Graeffe, Laguerre, and Jenkins and Traub. It includes many other methods and topics as well and has a chapter devoted to certain modern virtually optimal methods. Additionally, there are pointers to robust and efficient programs. This book is invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.

What people are saying  Write a review
We haven't found any reviews in the usual places.
Contents
1  
8 Graeffes RootSquaring Method  139 
9 Methods Involving Second or Higher Derivatives  215 
10 Bernoulli QuotientDifference and Integral Methods  381 
11 JenkinsTraub Minimization and Bairstow Methods  461 
12 LowDegree Polynomials  527 
Other editions  View all
Numerical Methods for Roots of Polynomials, Part 2 J. M. McNamee,Victor Y. Pan No preview available  2013 
Numerical Methods for Roots of Polynomials , Part 2 J.M. McNamee,Victor Pan No preview available  2013 
Common terms and phrases
Ak+1 algebraic algorithm annulus Appl apply approximation arithmetic assume bisection bisection method bitwise operations bound calculate Chapter Chebyshev cited paper coefficients complex roots Comput containing cubic define denote derivatives described disc disk divided differences efficiency evaluations example f(xi f(xk f(xn factor faster follows formula Fortran given gives Hence Henrici Hurwitz initial integer interpolation interval inverse iteration functions iterative method Laguerre's method linear Math matrix monic monic polynomial multiple roots Newton’s method nonlinear equations number of roots Numerical Analysis numerical tests obtain Padé approximation Petkovic polynomial of degree polynomial p(x proof Proposition quadratic radius real roots recursively Regula Falsi result rootfinding satisfying Schönhage secant method Section sequence simple roots solution solving splitting stability step Suppose Theorem tion unit circle values xi+1 xk+1 xn+1 zeros of p(x