A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides
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 condition...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-10-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/11/10/1302 |
id |
doaj-ec7550347cfb4d8597dca234b580d9b3 |
---|---|
record_format |
Article |
spelling |
doaj-ec7550347cfb4d8597dca234b580d9b32020-11-25T00:09:54ZengMDPI AGSymmetry2073-89942019-10-011110130210.3390/sym11101302sym11101302A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand SidesHong-Xiu Zhong0Xian-Ming Gu1Shao-Liang Zhang2School of Science, Jiangnan University, Wuxi 214122, Jiangsu, ChinaSchool of Economic Mathematics/Institute of Mathematics, Southwestern University of Finance and Economics, Chengdu 611130, Sichuan, ChinaDepartment of Applied Physics, Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, JapanThe 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 <i>A</i>, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate <i>A</i>-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms.https://www.mdpi.com/2073-8994/11/10/1302cocgcocrbreakdown-freecomplex symmetric matrixrank deficiencymultiple right-hand sides |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hong-Xiu Zhong Xian-Ming Gu Shao-Liang Zhang |
spellingShingle |
Hong-Xiu Zhong Xian-Ming Gu Shao-Liang Zhang A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides Symmetry cocg cocr breakdown-free complex symmetric matrix rank deficiency multiple right-hand sides |
author_facet |
Hong-Xiu Zhong Xian-Ming Gu Shao-Liang Zhang |
author_sort |
Hong-Xiu Zhong |
title |
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides |
title_short |
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides |
title_full |
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides |
title_fullStr |
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides |
title_full_unstemmed |
A Breakdown-Free Block COCG Method for Complex Symmetric Linear Systems with Multiple Right-Hand Sides |
title_sort |
breakdown-free block cocg method for complex symmetric linear systems with multiple right-hand sides |
publisher |
MDPI AG |
series |
Symmetry |
issn |
2073-8994 |
publishDate |
2019-10-01 |
description |
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 <i>A</i>, a precondition version of the breakdown-free BCOCG is proposed in detail. We also give the relative algorithms for the block conjugate <i>A</i>-orthogonal conjugate residual method. Numerical results illustrate that when breakdown occurs, the breakdown-free algorithms yield faster convergence than the non-breakdown-free algorithms. |
topic |
cocg cocr breakdown-free complex symmetric matrix rank deficiency multiple right-hand sides |
url |
https://www.mdpi.com/2073-8994/11/10/1302 |
work_keys_str_mv |
AT hongxiuzhong abreakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides AT xianminggu abreakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides AT shaoliangzhang abreakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides AT hongxiuzhong breakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides AT xianminggu breakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides AT shaoliangzhang breakdownfreeblockcocgmethodforcomplexsymmetriclinearsystemswithmultiplerighthandsides |
_version_ |
1725410241655341056 |