On the guaranteed convergence of the square-root iteration method (Q596189): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.cam.2003.12.040 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2003.12.040 / rank
 
Normal rank

Revision as of 04:32, 9 December 2024

scientific article
Language Label Description Also known as
English
On the guaranteed convergence of the square-root iteration method
scientific article

    Statements

    On the guaranteed convergence of the square-root iteration method (English)
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    The paper is devoted to the convergence analysis of the so-called Ostrowski-like iterative method for the simultaneous approximation of all simple zeros \(z_{i}\) of a given polynomial \(P\). (This method is an extension of the well-known square-root method \[ z^{m+1}_{i}=z^{m}_{i}-\frac{P(z^{m}_{i})}{\sqrt{P'(z^{m}_{i})-P(z^{m}_{i})P''(z^{m}_{i})}}, \] also known as Ostrowski's method). The main result of the paper (Theorem 1) asserts that for a polynomial of degree \(n\geq3\) with simple zeros, satisfying a certain initial condition, the Ostrowski-like simultaneous method is convergent and its order of convergence is four.
    0 references
    simple zeros
    0 references
    Ostrowski-like iteration
    0 references
    initial condition
    0 references
    convergence
    0 references
    zeros of polynomials
    0 references
    point estimation
    0 references
    square-root method
    0 references

    Identifiers

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