Adaptive version of simpler GMRES (Q849149)
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: Adaptive version of simpler GMRES |
scientific article; zbMATH DE number 5674599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive version of simpler GMRES |
scientific article; zbMATH DE number 5674599 |
Statements
Adaptive version of simpler GMRES (English)
0 references
24 February 2010
0 references
The authors propose and theoretically analyze a stable version of simpler generalized minimal residual (GMRES) algorithm, based on an adaptive choice of the Krylov subspace basis at a given iteration step. They show that this adaptive choice of direction vectors keeps the basis well-conditioned and that the condition number grows at most linearly with the iteration number.
0 references
nonsymmetric linear systems
0 references
Krylov subspace methods
0 references
minimum residual methods
0 references
numerical stability
0 references
rounding errors
0 references
condition number
0 references
simpler generalized minimal residual (GMRES) algorithm
0 references
0 references
0.9108839
0 references
0.9080226
0 references
0.9026146
0 references
0.87499124
0 references
0 references
0.86703527
0 references
