Iterative methods for roots of polynomials
We describe iterative methods for polynomial zero finding and, specifically, the Laguerre method and how it is used in the NAG subroutine C02AFF. We also investigate a bug that has been in this subroutine for ten years. In chapter two, we give a brief survey of some zero finding methods. These inclu...
Main Author: | Mekwi, W |
---|---|
Format: | Thesis |
Published: |
University of Oxford;Mathematical Institute
2001
|
Similar Items
-
Geometry of the locus of polynomials of degree 4 with iterative roots
by: Strycharz-Szemberg Beata, et al.
Published: (2011-04-01) -
Enclosing roots of polynomial equations and their applications to iterative processes
by: Saïd Hilout, et al.
Published: (2009-11-01) -
Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
by: Mudassir Shams, et al.
Published: (2021-11-01) -
New iterative algorithms for solving polynomials with simple and multiple roots /
by: Saeid Saidanlu, 1975-, author, et al.
Published: (2014) -
Roots of Characteristic Polynomial Sequences in Iterative Block Cyclic Reductions
by: Masato Shinjo, et al.
Published: (2021-12-01)