Estimating the local radius of convergence for Picard iteration (Q1662597)

From MaRDI portal
Revision as of 09:21, 16 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Estimating the local radius of convergence for Picard iteration
scientific article

    Statements

    Estimating the local radius of convergence for Picard iteration (English)
    0 references
    0 references
    20 August 2018
    0 references
    Summary: In this paper, we propose an algorithm to estimate the radius of convergence for the Picard iteration in the setting of a real Hilbert space. Numerical experiments show that the proposed algorithm provides convergence balls close to or even identical to the best ones. As the algorithm does not require to evaluate the norm of derivatives, the computing effort is relatively low.
    0 references
    fixed point
    0 references
    Picard iteration
    0 references
    local convergence
    0 references
    radius of convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers