A Set of Flexible-GMRES Routines for Real and Complex Arithmetics

@inproceedings{Frayss1998ASO,
  title={A Set of Flexible-GMRES Routines for Real and Complex Arithmetics},
  author={Val{\'e}rie Frayss{\'e} and Luc Giraud and Serge Gratton},
  year={1998}
}
In this report we describe our implementations of the FGMRES algorithm for both real and complex, single and double precision arithmetics suitable for serial, shared memory and distributed memory computers. For the sake of portability, simplicity, flexibility and efficiency the FGMRES solvers have been implemented in Fortran 77 using the reverse communication mechanism for the matrix-vector product, the preconditioning and the dot product computations. For distributed memory computation… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

A exible inner-outer preconditioned GMRES algorithm

  • Y. Saad
  • SIAM J. Sci. Comput.,
  • 1993
Highly Influential
7 Excerpts

A set of GMRES routines for real and complex arith- metics

  • V. Frayss e, L. Giraud, S. Gratton
  • Technical Report TR/PA/97/49, CERFACS,
  • 1997
2 Excerpts

Numerics of Gram-Schmidt orthogonalization

  • A. Bj orck
  • Linear Algebra Appl.,
  • 1994
1 Excerpt

Stopping criteria for iterative solvers

  • M. Arioli, I. S. Du, D. Ruiz
  • SIAM J. Matrix Anal. Appl.,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…