Mekwi, W. R. (2001) Iterative methods for roots of polynomials. Masters thesis, University of Oxford.
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 include Bairstow's method, Bernoulli's method, Graeffe's root-squaring method, Müller's method, the Newton-Raphson method and the Jenkins-Traub and Laguerre methods. In chapter three, we look at the Laguerre method as used in C02AFF in further detail, describe the behaviour of the bug and how the problem has been solved. We also describe general tests for zero finding algorithms and results of comparisons between NAG's C02AFF and other zero finding programs. Chapter 4 involves comparisons of C02AFF with other methods and a note on error bounds. Finally, we make our proposals and conclusions in chapter 5.
|Item Type:||Thesis (Masters)|
|Subjects:||A - C > Computer science|
H - N > Numerical analysis
|Deposited By:||Eprints Administrator|
|Deposited On:||03 Mar 2004|
|Last Modified:||29 May 2015 18:15|
Repository Staff Only: item control page