Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 545470, 12 pages
http://dx.doi.org/10.1155/2011/545470
Research Article

A Polynomial Preconditioner for the CMRH Algorithm

1School of Mathematical Sciences, Xiamen University, Xiamen 361005, China
2School of Mathematics and Computer Science, Guizhou Normal University, Guiyang 550001, China

Received 4 June 2010; Revised 21 December 2010; Accepted 24 January 2011

Academic Editor: P. Liatsis

Copyright © 2011 Jiangzhou Lai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Saad and M. H. Schultz, “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems,” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 3, pp. 856–869, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. H. Sadok, “CMRH: a new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm,” Numerical Algorithms, vol. 20, no. 4, pp. 303–321, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. M. B. van Gijzen, “A polynomial preconditioner for the GMRES algorithm,” Journal of Computational and Applied Mathematics, vol. 59, no. 1, pp. 91–107, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. P. E. Saylor and D. C. Smolarski, “Implementation of an adaptive algorithm for Richardson's method,” Linear Algebra and its Applications, vol. 154–156, pp. 615–646, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. P. N. Brown, “A theoretical comparison of the Arnoldi and GMRES algorithms,” SIAM Journal on Scientific and Statistical Computing, vol. 12, no. 1, pp. 58–78, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. R. T. Gregory and D. L. Karney, A Collection of Matrices for Testing Computational Algorithms, John Wiley & Sons, New York, NY, USA, 1969.