Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892133 | Computers & Mathematics with Applications | 2018 | 12 Pages |
Abstract
Bai (2010) proposed an efficient Hermitian and skew-Hermitian splitting (HSS) iteration method for solving a broad class of large sparse continuous Sylvester equations. To further improve the efficiency of the HSS method, in this paper we present a preconditioned HSS (PHSS) iteration method and its non-alternating variant (NPHSS) for this matrix equation. The convergence properties of the PHSS and NPHSS methods are studied in depth and the quasi-optimal values of the iteration parameters for the two methods are also derived. Moreover, to reduce the computational cost, we establish the inexact variants of the two iteration methods. Numerical experiments illustrate the efficiency and robustness of the two iteration methods and their inexact variants.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Xu Li, Hai-Feng Huo, Ai-Li Yang,