Convergence conditions of some methods for the simultaneous computation of polynomial zero (Q1272804)

From MaRDI portal
Revision as of 21:11, 17 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Convergence conditions of some methods for the simultaneous computation of polynomial zero
scientific article

    Statements

    Convergence conditions of some methods for the simultaneous computation of polynomial zero (English)
    0 references
    0 references
    0 references
    25 May 1999
    0 references
    The paper is concerned with polynomial roots finding. Three known iterative methods are analyzed: Newton's method, Aberth's method and Durand-Kerner's method. The methods of Aberth and of Durand-Kerner give simultaneous approximations of the roots of a polynomial and have a local superlinear convergence, in case of simple roots. The author analyzes the convergence of these methods and, for each of the methods cited above, gives conditions on the starting approximation under which the approximation error tends to zero in a doubly exponential way.
    0 references
    iterative methods
    0 references
    Newton's method
    0 references
    Aberth's method
    0 references
    Durand-Kerner's method
    0 references
    convergence
    0 references
    zeros of polynomials
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references