CGS/GMRES(k): AN ADAPTIVE PRECONDITIONED CGS ALGORITHM FOR NONSYMMETRIC LINEAR SYSTEMS

被引:3
作者
曹海燕
李兴伟
机构
关键词
Krylov subspace methods; CGS; GMRES;
D O I
暂无
中图分类号
O241 [数值分析];
学科分类号
070102 ;
摘要
Recently Y. Saad proposed a flexible inner-outer preconditioned GMRES algorithm for nonsymmetric linear systems [4]. Following their ideas, we suggest an adaptive preconditioned CGS method, called CGS/GMRES (k), in which the preconditioner is constructed in the iteration step of CGS, by several steps of GMRES(k). Numerical experiments show that the residual of the outer iteration decreases rapidly. We also found the interesting residual behaviour of GMRES for the skewsymmetric linear system Ax = b, which gives a convergence result for restarted GMRES (k). For convenience, we discuss real systems.
引用
收藏
页码:145 / 158
页数:14
相关论文
共 7 条
  • [1] Solution of systems of linear equations by minimized iterations. Lanczos C. Journal of Research of the National Bureau of Standards . 1952
  • [2] Preconditioning techniques for nonsymmtric and indefinite linear systems. Saad, Y. Jounal of Computational and Applied Mathematics . 1988
  • [3] A direct solver for the least-squares problem arising from GMRES (k). Galan, M.J,Montero, G,Winter, G. Communication in numerical methods in Engineering . 1994
  • [4] GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. Saad Y, Schultz MH. SIAM Journal on Scientific and Statistical Computing . 1986
  • [5] A flexible inner-outer preconditioned GMRES algorithm. Saad Y. SIAM Journal on Scientific Computing . 1993
  • [6] Methods of conjugate gradients for solving linear systems. Hestenes M R, Stiefel E L. Journal of Research of the National Bureau of Standards . 1952
  • [7] CGS, a fast Lanczos-type solver for nonsymmetric linear systems. Sonneveld, P. SIAM J. Sci, Stat. Comput . 1988