Numerical Methods for Roots of Polynomials - Part I
By- J.M. McNamee, York University, Toronto, Canada
This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newtons, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincents method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled A Handbook of Methods for Polynomial Root-finding. This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.
Audience
academic faculties and libraries, engineering industry
Studies in Computational Mathematics
Hardbound, 354 Pages
Published: June 2007
Imprint: Elsevier
ISBN: 978-0-444-52729-5
Reviews
-
"[A] very interesting book to read. It is clearly written and contains numerous examples that make the results presented in the book clearer. The book also contains many pointers to efficient programs, software and libraries to compute roots of polynomials."--Mathematical Reviews
Contents
Preface
Contents
Introduction
1. Evaluation, Convergence, Bounds
2. Sturm Sequences and Greatest Common Divisors
3. Real Roots by Continued Fractions
4. Simultaneous Methods
5. Newton's and Related Methods
6. Matrix Models
Index

