Guaranteed convergence rate estimates for a class of iterative procedures: their comparison (Q2487542)
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: Guaranteed convergence rate estimates for a class of iterative procedures: their comparison |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guaranteed convergence rate estimates for a class of iterative procedures: their comparison |
scientific article |
Statements
Guaranteed convergence rate estimates for a class of iterative procedures: their comparison (English)
0 references
8 August 2005
0 references
Asynchronous methods for approximating the solution of a system of nonlinear equations in fixed point form (in a general Banach space setting) are considered. Besides the standard sequential approximation method, where all components of the approximate solution are synchronously updated in each iteration step, more general iterative procedures are discussed, where only some of the components of the approximate solution are updated in each step. In particular the case is studied where the subsets of updated components change periodically. For this class of methods convergence rate estimates are derived and the question of optimal strategies for selecting the subsets of updated components is addressed.
0 references
systems of nonlinear equations
0 references
fixed point form
0 references
asynchronous methods
0 references
convergence rate estimates
0 references
0.91540134
0 references
0.90960443
0 references
0.8936159
0 references
0.8926722
0 references