A Polynomial Preconditioner for the CMRH Algorithm.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2011, Article ID 545470, 12 pages doi:10.1155/2011/545470 Research Article A Polynomial Preconditioner for the CMRH Algorithm Jiangzhou Lai,1 Linzhang Lu,1, 2 and Shiji Xu1 1 School of Mathematical Sciences, Xiamen University, Xiamen 361005, China 2 School of Mathematics and Computer Science, Guizhou Normal University, Guiyang 550001, China Correspondence should be addressed to Linzhang Lu, lzlu@ Received 4 June 2010; Revised 21 December 2010; Accepted 24 January 2011 Academic Editor: P. Liatsis Copyright q 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. Many large and sparse linear systems can be solved efficiently by restarted GMRES and CMRH methods Sadok 1999. The CMRHm method is less expensive and requires slightly less storage than GMRESm. But like GMRES, the restarted CMRH method may not converge. In order to remedy this defect, this paper presents a polynomial preconditioner for CMRH-based algorithm. Numerical experiments are given to show that the polynomial preconditioner is quite simple and easily constructed and the preconditioned CMRHm with the polynomial preconditioner has better performance than CMRH m. 1. Introduction In many practical applications, we have to solve a large and sparse, nonsymmetric linear system of equations Ax b, 1.1 where A ∈ Rn×n n is nonsingular, and x, b ∈ R . The linear system 1.1 can be solved efficiently by iterative metho