Multiple search direction conjugate gradient method II: theory and numerical experiments

Authors: Tongxiang Gu¹; Xingping Liu²; Zeyao Mo²; Xuebin Chi¹

Source: International Journal of Computer Mathematics, Volume 81, Number 10, October 2004 , pp. 1289-1307(19)

Buy & download fulltext article:

Price: $56.94 plus tax (Refund Policy)

Abstract:

In this article, we give the convergence and consistency of the MSD-CG method [Gu, T.-X., Liu, X.-P., Mo, Z.-Y. and Chi, X.-B. (in press). Multiple search direction conjugate gradient method I: Methods and their propositions. Int. J. Comput. Math.] and estimate the convergence rate of this method. Numerical experiments on two distributed parallel computers, Dawning 3000 and P-II Cluster, show the efficiency of our method and show that it compares favorably with some domain decomposition methods.

Keywords: Linear systems; Conjugate gradient-type method; Massively parallel computing; Inner product; Global communication

Document Type: Research article

DOI: http://dx.doi.org/10.1080/00207160412331289065

Affiliations: 1: Supercomputing Center of Computer Network Information Center Chinese Academy of Science P.O. Box 349 Beijing 100080 P.R. China 2: Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics P.O. Box 8009 Beijing 100088 P.R. China

Publication date: 2004-10-01

More about this publication?