A parallel algorithm of ICSYM for complex symmetric linear systems in quantum chemistry

Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (CSYM). Using three-term recurrence relation and orthogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.

[1]  H. Martin Bücker,et al.  A Parallel Version of the Quasi-Minimal Residual Method, Based on Coupled Two-Term Recurrences , 1996, PARA.

[2]  Jack Dongarra,et al.  A Test Matrix Collection for Non-Hermitian Eigenvalue Problems , 1997 .

[3]  Thomas Weiland,et al.  Comparison of Krylov-type methods for complex linear systems applied to high-voltage problems , 1998 .

[4]  Jean-Marc Adamo.  Parallel A* Algorithm , 1998 .

[5]  A. Bunse-Gerstner,et al.  On a conjugate gradient-type method for solving complex symmetric linear systems , 1999 .

[6]  Dianne P. O'Leary,et al.  Eigenanalysis of some preconditioned Helmholtz problems , 1999, Numerische Mathematik.

[7]  Laurence T. Yang,et al.  The improved BiCG method for large and sparse linear systems on parallel distributed memory architectures , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  L.T. Yang,et al.  The improved BiCGStab method for large and sparse unsymmetric linear systems on parallel distributed memory architectures , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[9]  Liang Chang-hong.  Iterative solution for dense linear systems arising in computational electromagnetics , 2003 .

[10]  T. Sogabe,et al.  A COCR method for solving complex symmetric linear systems , 2007 .

[11]  Peter Monk,et al.  Solving Maxwell's equations using the ultra weak variational formulation , 2007, J. Comput. Phys..

[12]  Tongxiang Gu,et al.  Conjugate residual squared method and its improvement for non-symmetric linear systems , 2010, Int. J. Comput. Math..

[13]  Zhonghua Qiao,et al.  A Fast Preconditioned Iterative Algorithm for the Electromagnetic Scattering from a Large Cavity , 2012, J. Sci. Comput..

[14]  Long Yuan,et al.  A Weighted Variational Formulation Based on Plane Wave Basis for Discretization of Helmholtz Equations , 2013 .

[15]  Yang Liu,et al.  A Parallel Version of COCR Method for Solving Complex Symmetric Linear Systems , 2014, CloudCom 2014.

[16]  Long Yuan,et al.  A Plane-Wave Least-Squares Method for Time-Harmonic Maxwell's Equations in Absorbing Media , 2014, SIAM J. Sci. Comput..

[17]  Markus Clemens,et al.  The SCBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems , 2015, Comput. Phys. Commun..