Performance analysis of a flexible restarted fom(k) algorithm

  • Yun, Jae-Heon (Department of Mathematics, College of Natural Sciences, Chungbuk National University, Cheongju 361-763)
  • Published : 1997.11.01

Abstract

This paper contains a convergence analysis of a flexible restarted FOM(k)(FFOM(k)), and its performance is compared with FGMRES(k). Performances of these two algorithms with variable preconditioners are also compared with those of preconditioned FOM(k) and GMRES(k). Numerical experiments show that FFOM(k) performs as well as, or better than for some problems, FGMRES(k).

References

  1. SIAM Templates for the solution of linear systems:Building blocks for iterative methods R. Barrett(et al.)
  2. SIAM J. Sci. Statist. Comput. v.12 A theoretical comparison of the Arnoldi and GMRES algorithms P.N. Brown
  3. Math. Comput. v.31 An iterative solution method for linear systems of which the corfficient matrix is a symmetric M-matrix J.A. Meijerink;H.A. Vorst
  4. Math. Comput. v.37 Krylov subspace methods for solving large unsymmetric linear systems Y. Saad
  5. SIAM J. Sci. Statist. Comput. v.14 A flexible inner-outer preconditioned GMRES algorithm Y. Saad
  6. SIAM J. Sci. Statist. Comput. v.7 GMRES: a generalized minimum residual algorithm for solving nonsymmetric linear systems Y. Saad;M.H. Schultz
  7. SIAM J. Sci. Statist. Comput. v.12 BiCGSTAB:A fast and smoothly converging variant of BiCG for the solution of non-symmetric linear systems H.A, Vorst