Two variants of the PMHSS iteration method for a class of complex symmetric indefinite linear systems

Yang Cao and Zhi-Ru Ren

Applied Mathematics and Computation, 2015, vol. 264, issue C, 61-71

Abstract: For a class of complex symmetric indefinite linear systems, we present two variants of the preconditioned modified Hermitian and skew-Hermitian splitting (PMHSS) iteration method. One is a generalization of the PMHSS iteration method and the other is a generalization of the lopsided PMHSS iteration method. We study the convergence properties of these two variants by analyzing the upper bounds of spectral radiuses of the corresponding iteration matrices and compare these upper bounds. Numerical examples are illustrated to show the effectiveness of the proposed iteration methods.

Keywords: Complex symmetric indefinite linear systems; PMHSS iteration; Lopsided PMHSS iteration; Convergence (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031500507X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:264:y:2015:i:c:p:61-71

DOI: 10.1016/j.amc.2015.04.049

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().