Modified HSS iteration methods for a class of complex symmetric linear systems
- 647 Downloads
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.
KeywordsComplex symmetric matrix Hermitian and skew-Hermitian splitting Iteration method Krylov subspace method Convergence analysis Preconditioning
Mathematics Subject Classification (2000)65F10 65F50 65N22 CR: G1.3
Unable to display preview. Download preview PDF.
- 9.Frommer A, Lippert T, Medeke B, Schilling K (eds) (2000) Numerical challenges in lattice quantum chromodynamics. Lecture notes in computational science and engineering, vol 15. Springer, HeidelbergGoogle Scholar
- 15.van Dijk W, Toyama FM (2007) Accurate numerical solutions of the time-dependent Schrödinger equation. Phys Rev E 75: 036707-1–036707-10Google Scholar