A fast implementation for GMRES method

被引:19
|
作者
Ayachour, EH [1 ]
机构
[1] Univ Havre, Fac Sci & Tech, Lab Math Appl, F-76058 Le Havre, France
关键词
linear systems; Krylov subspaces; least-squares problems; minimal residual methods;
D O I
10.1016/S0377-0427(03)00534-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:269 / 283
页数:15
相关论文
共 50 条