A Kind of Preconditioned IGMRES(m) Algorithm

Article Preview

Abstract:

Fundamental theories are studied for an Incomplete Generalized Minimal Residual Method(IGMRES(m)) in Krylov subspace. An algebraic equations generated from the IGMRES(m) algorithm is presented. The relationships are deeply researched for the algorithm convergence and the coefficient matrix of the equations. A kind of preconditioned method is proposed to improve the convergence of the IGMRES(m) algorithm. It is proved that the best convergence can be obtained through appropriate matrix decomposition.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 482-484)

Pages:

413-416

Citation:

Online since:

February 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y. Saad and M. H. Schultz: SIAM J. Sci. Comput.. Vol. 7 (1986), p.856

Google Scholar

[2] Information on http://www.cambridge.org/9780521116596

Google Scholar

[3] G. X. Shen, D.Y. Liu and C.X. Yu: Fast multipole boundary element method and engineering of rolling mill (Science Press, China 2005). (In Chinese)

Google Scholar

[4] I.C. Ipsen and C.D. Meyer: Amer. Math. Month.. Vol. 105 (1998), p.889

Google Scholar

[5] Z.X. Jia: Science in China (Series A). Vol. 28 (1998), p.694 (In Chinese)

Google Scholar

[6] C.X. Yu: IJICIC. Vol. 5 (2009), p.1785

Google Scholar

[7] Department of Mathematics: Advanced algebra. (Higher Edu. Press, China 1995). (In Chinese)

Google Scholar

[8] C.X. Yu: ICIC-EL. Vol. 3 (2008), p.89

Google Scholar

[9] Information on http://www.tup.com.cn

Google Scholar