A COMINRES-QLP Method for Solving Complex Symmetric Linear Systems

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

scholarly journals A COMINRES‐QLP method for solving complex symmetric linear systems

2021 ◽  
Author(s):  
Lijun Liu ◽  
Kazuaki Sekiya ◽  
Masao Ogino ◽  
Koki Masui
Keyword(s):  
Linear Systems ◽  
Complex Symmetric Linear Systems ◽  
Complex Symmetric

401 A study of some iterative methods for complex symmetric linear systems

2000 ◽  
Vol 2000.53 (0) ◽  
pp. 85-86
Author(s):  
Hiroshi KANAYAMA ◽  
Daisuke TAGAMI ◽  
Ryuji SHIOYA ◽  
Masahiro SAITO
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Complex Symmetric Linear Systems ◽  
Complex Symmetric

Accelerated GPMHSS Method for Solving Complex Systems of Linear Equations

2017 ◽  
Vol 7 (1) ◽  
pp. 143-155 ◽  
Author(s):  
Jing Wang ◽  
Xue-Ping Guo ◽  
Hong-Xiu Zhong
Keyword(s):  
Complex Systems ◽  
Linear Systems ◽  
Iteration Method ◽  
Numerical Experiments ◽  
Linear Equations ◽  
Splitting Method ◽  
Complex Symmetric Linear Systems ◽  
Systems Of Linear Equations ◽  
Complex Symmetric ◽  
Symmetric Systems

AbstractPreconditioned modified Hermitian and skew-Hermitian splitting method (PMHSS) is an unconditionally convergent iteration method for solving large sparse complex symmetric systems of linear equations, and uses one parameter α. Adding another parameter β, the generalized PMHSS method (GPMHSS) is essentially a twoparameter iteration method. In order to accelerate the GPMHSS method, using an unexpected way, we propose an accelerated GPMHSS method (AGPMHSS) for large complex symmetric linear systems. Numerical experiments show the numerical behavior of our new method.

scholarly journals A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1302
Author(s):  
Hong-Xiu Zhong ◽  
Xian-Ming Gu ◽  
Shao-Liang Zhang
Keyword(s):  
Linear Systems ◽  
Spectral Properties ◽  
Coefficient Matrix ◽  
Complex Symmetric Linear Systems ◽  
Right Hand ◽  
Orthogonality Conditions ◽  
Free Block ◽  
Complex Symmetric ◽  
The Right ◽  
Conjugate Residual

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.

Sign in / Sign up

Export Citation Format

Share Document