A fast implementation for GMRES method (Q1414304)
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: A fast implementation for GMRES method |
scientific article; zbMATH DE number 2006398
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast implementation for GMRES method |
scientific article; zbMATH DE number 2006398 |
Statements
A fast implementation for GMRES method (English)
0 references
20 November 2003
0 references
For the popular generalized minimal residual (GMRES) iteration method a new and simple implementation is presented, which has the property of not using Givens rotations. By this modification the Arnoldi process is not modified and this new method has advantages in both computation cost and storage reqirements. The corresponding restarted version of the GMRES method is also considered.
0 references
generalized minimal residual method
0 references
Arnoldi process
0 references
Krylov subspace method
0 references
GMRES method
0 references
0 references
0 references
0 references
0 references
0 references
