Estimating the local radius of convergence for Picard iteration

From MaRDI portal
Publication:1662597





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.



Cites work









This page was built for publication: Estimating the local radius of convergence for Picard iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662597)