Estimating the local radius of convergence for Picard iteration (Q1662597)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimating the local radius of convergence for Picard iteration |
scientific article; zbMATH DE number 6920555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating the local radius of convergence for Picard iteration |
scientific article; zbMATH DE number 6920555 |
Statements
Estimating the local radius of convergence for Picard iteration (English)
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.8990103602409363
0 references
0.8267526030540466
0 references
0.8100773692131042
0 references
0.7994038462638855
0 references
0.7801797986030579
0 references
