Newton's method and generation of a determinantal family of iteration functions (Q1975681)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Newton's method and generation of a determinantal family of iteration functions
scientific article

    Statements

    Newton's method and generation of a determinantal family of iteration functions (English)
    0 references
    0 references
    0 references
    8 February 2001
    0 references
    Iterative methods of Newton type can be regarded as fixed point iterations, with appropriate iteration functions. For example, the Newton's method is defined by the iteration function \(G(x)=x-\frac{f(x)}{f'(x)}.\) The authors introduce a family \({B_{m}(x)}_{m=2}^{\infty}\) of iteration functions for constructing high-order methods for approximation of roots of a polynomial f(x), and prove that this class is equivalent to the family \({G_{m}(x)}_{m=2}^{\infty}\) of iteration functions introduced by \textit{J. Gerlach} [SIAM Rev. 36, No. 2, 272-276 (1994; Zbl 0814.65046)].
    0 references
    polynomial root
    0 references
    Newton's method
    0 references
    high-order method
    0 references
    root finding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references