CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm |
| |
Authors: | H Sadok |
| |
Institution: | (1) Université du Littoral, zone universitaire de la Mi-voix, Batiment H. Poincaré, 50 rue F. Buisson, BP 699, F-62228 Calais Cedex, France |
| |
Abstract: | The Generalized Minimal Residual (GMRES) method and the Quasi-Minimal Residual (QMR) method are two Krylov methods for solving
linear systems. The main difference between these methods is the generation of the basis vectors for the Krylov subspace.
The GMRES method uses the Arnoldi process while QMR uses the Lanczos algorithm for constructing a basis of the Krylov subspace.
In this paper we give a new method similar to QMR but based on the Hessenberg process instead of the Lanczos process. We call
the new method the CMRH method. The CMRH method is less expensive and requires slightly less storage than GMRES. Numerical
experiments suggest that it has behaviour similar to GMRES.
This revised version was published online in June 2006 with corrections to the Cover Date. |
| |
Keywords: | linear systems iterative methods Hessenberg’ s method GMRES QMR 65F10 |
本文献已被 SpringerLink 等数据库收录! |