scholarly journals Preconditioning Complex Symmetric Linear Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Enrico Bertolazzi ◽  
Marco Frego

A new preconditioner for symmetric complex linear systems based on Hermitian and skew-Hermitian splitting (HSS) for complex symmetric linear systems is herein presented. It applies to conjugate orthogonal conjugate gradient (COCG) or conjugate orthogonal conjugate residual (COCR) iterative solvers and does not require any estimation of the spectrum of the coefficient matrix. An upper bound of the condition number of the preconditioned linear system is provided. To reduce the computational cost the preconditioner is approximated with an inexact variant based on incomplete Cholesky decomposition or on orthogonal polynomials. Numerical results show that the present preconditioner and its inexact variant are efficient and robust solvers for this class of linear systems. A stability analysis of the inexact polynomial version completes the description of the preconditioner.

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1302
Author(s):  
Hong-Xiu Zhong ◽  
Xian-Ming Gu ◽  
Shao-Liang Zhang

The block conjugate orthogonal conjugate gradient method (BCOCG) is recognized as a common method to solve complex symmetric linear systems with multiple right-hand sides. However, breakdown always occurs if the right-hand sides are rank deficient. In this paper, based on the orthogonality conditions, we present a breakdown-free BCOCG algorithm with new parameter matrices to handle rank deficiency. To improve the spectral properties of coefficient matrix A, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate A-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms.


2011 ◽  
Vol 1 (2) ◽  
pp. 97-107 ◽  
Author(s):  
Tomohiro Sogabe ◽  
Shao-Liang Zhang

AbstractThe Conjugate Orthogonal Conjugate Residual (COCR) method [T. Sogabe and S.-L. Zhang, JCAM, 199 (2007), pp. 297-303.] has recently been proposed for solving complex symmetric linear systems. In the present paper, we develop a variant of the COCR method that allows the efficient solution of complex symmetric shifted linear systems. Some numerical examples arising from large-scale electronic structure calculations are presented to illustrate the performance of the variant.


2020 ◽  
Vol 140 (12) ◽  
pp. 832-841
Author(s):  
Lijun Liu ◽  
Kazuaki Sekiya ◽  
Masao Ogino ◽  
Koki Masui

2000 ◽  
Vol 2000.53 (0) ◽  
pp. 85-86
Author(s):  
Hiroshi KANAYAMA ◽  
Daisuke TAGAMI ◽  
Ryuji SHIOYA ◽  
Masahiro SAITO

Sign in / Sign up

Export Citation Format

Share Document