Thesis icon

Thesis

Iterative methods for roots of polynomials

Abstract:

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 Lag...

Expand abstract

Actions


Access Document


Files:

Authors


Publication date:
2001
URN:
uuid:a1cb2db7-b587-4a0f-a442-dc3e06797726
Local pid:
oai:eprints.maths.ox.ac.uk:16

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP