Modified HSS iteration methods for a class of complex symmetric linear systems

Authors:
Zhong-Zhi Bai;Michele Benzi;Fang Chen
Affiliations:
Guizhou Normal Univ., Sch. of Math. and Comp. Sci., 550001, Guiyang, PRC and Acad. of Math. and Sys. Sci., Ch. Acad. of Sci., State Key Lab. of Sci./Eng. Comp., Inst. of Computational Math. and Sc ...;Emory University, Department of Mathematics and Computer Science, 30322, Atlanta, GA, USA;Xi’an Jiaotong University, Department of Mathematical Sciences, 710049, Xi’an, People’s Republic of China and Xi’an University of Post and Telecommunication, Department ...
Venue:
Computing
Year:
2010

Citing 5
Cited 5

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A flexible inner-outer preconditioned GMRES algorithm

SIAM Journal on Scientific Computing
Conjugate Gradient Methods for Toeplitz Systems

SIAM Review
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems

SIAM Journal on Matrix Analysis and Applications

On preconditioned MHSS iteration methods for complex symmetric linear systems

Numerical Algorithms
Letter to the editor: Stability analysis of block LU factorization for complex symmetric block tridiagonal matrices

Journal of Computational and Applied Mathematics
On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation AXB=C

Computers & Mathematics with Applications
Additive block diagonal preconditioning for block two-by-two linear systems of skew-Hamiltonian coefficient matrices

Numerical Algorithms
On semi-convergence of modified HSS iteration methods

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce and analyze a modification of the Hermitian and skew-Hermitian splitting iteration method for solving a broad class of complex symmetric linear systems. We show that the modified Hermitian and skew-Hermitian splitting (MHSS) iteration method is unconditionally convergent. Each iteration of this method requires the solution of two linear systems with real symmetric positive definite coefficient matrices. These two systems can be solved inexactly. We consider acceleration of the MHSS iteration by Krylov subspace methods. Numerical experiments on a few model problems are used to illustrate the performance of the new method.