This paper presents enhancement strategies for the Hermitian and skew-Hermitian splitting method based on gradient iterations. The spectral properties are exploited for the parameter estimation, often resulting in a better convergence. In particular, steepest descent with early stopping can generate a rough estimate of the optimal parameter. This is better than an arbitrary choice since the latter often causes stability problems or slow convergence. Additionally, lagged gradient methods are considered as inner solvers for the splitting method. Experiments show that they are competitive with conjugate gradient in low precision.
By applying the minimal residual technique to the Hermitian and skew-Hermitian (HSS) iteration scheme, we introduce a non-stationary iteration method named minimal residual Hermitian and skew-Hermitian (MRHSS) iteration method to solve the continuous Sylvester equation. Numerical results verify the effectiveness and robustness of the MRHSS iteration method versus the HSS method for the continuous Sylvester equation. Moreover, by numerical computation, we show that the MRHSS splitting can be used as a splitting preconditioner and induce accurate, robust and effective preconditioned Krylov subsp…
We propose an improved version of the Hermitian/skew-Hermitian splitting (HSS) iterative method, which we call HSS(0), to solve non-Hermitian linear systems with a positive definite Hermitian part. The improvement is based on solving the Hermitian half iteration without a shift, and applying a shift only for the skew-Hermitian solve. An optimal parameter is derived analytically, and a corresponding upper bound on the convergence speed is obtained. Using a combination of analytical proofs and numerical validations, we show that HSS(0) yields a dramatically faster convergence speed than standard…
In this paper we explore orthogonal systems in $\mathrm{L}_2(\mathbb{R})$ which give rise to a skew-Hermitian, tridiagonal differentiation matrix. Surprisingly, allowing the differentiation matrix to be complex leads to a particular family of rational orthogonal functions with favourable properties: they form an orthonormal basis for $\mathrm{L}_2(\mathbb{R})$, have a simple explicit formulae as rational functions, can be manipulated easily and the expansion coefficients are equal to classical Fourier coefficients of a modified function, hence can be calculated rapidly. We show that this famil…
We introduce and develop a theory of orthogonality with respect to Sobolev inner products on the real line for sequences of functions with a tridiagonal, skew-Hermitian differentiation matrix. While a theory of such L2-orthogonal systems is well established, Sobolev orthogonality requires new concepts and their analysis. We characterise such systems completely as appropriately weighed Fourier transforms of orthogonal polynomials and present a number of illustrative examples, inclusive of a Sobolev-orthogonal system whose leading N coefficients can be computed in $\mathcal{O}(N \log N)$ operati…
Structured rational matrices such as symmetric, skew-symmetric, Hamiltonian, skew-Hamiltonian, Hermitian, and para-Hermitian rational matrices arise in many applications. Linearizations of rational matrices have been introduced recently for computing poles, eigenvalues, eigenvectors, minimal bases and minimal indices of rational matrices. For structured rational matrices, it is desirable to construct structure-preserving linearizations so as to preserve the symmetry in the eigenvalues and poles of the rational matrices. With a view to constructing structure-preserving linearizations of structu…
We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on Chebyshev polynomials of degrees 2, 4, 8, 12 and 18 which are computed with only 1, 2, 3, 4 and 5 matrix-matrix products, respectively. For problems of the form $\exp(-iA)$, with $A$ a real and symmetric matrix, an improved version is presented that computes the sine and cosine of $A$ with a reduced computational cost. The theoretical analysis, supported by num…
For solving the continuous Sylvester equation, a class of the multiplicative splitting iteration method is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations and it can be equivalently written as two multiplicative splitting matrix equations. When both coefficient matrices in the continuous Sylvester equation are (non-symmetric) positive semi-definite, and at least one of them is positive definite; we can choose Hermitian and skew-Hermitian (HS) splittings of matrices $A$ and $B$, in the first equation, and the sp…
We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse continuous Sylvester equations $AX + XB = C$, where the coefficient matrices $A$ and $B$ are Toeplitz matrices. A theoretical study shows that if the circulant and skew-circulant splitting factors of $A$ and $B$ are positive semi-definite and at least one is positive definite (not necessarily Hermitian), then the CSCS method converges to the unique solution of the Sylvester equation. In addition, we obtain an upper bound for the convergence factor of the CSCS iteration. This convergence factor …
Structure preserving quaternion conjugate gradient-type methods for solving non-Hermitian quaternion linear systems
School of Mathematics and Statistics, Key Laboratory of Analytical Mathematics and Applications (Ministry of Education), Fujian Normal University（福建师范大学数学与统计学院，分析数学及应用教育部重点实验室）；School of Mathematics and Statistics, Hainan University（海南大学数学与统计学院）；School of Mathematical Sciences, South China Normal University（华南师范大学数学科学学院）
The calculation of a segment of eigenvalues and their corresponding eigenvectors of a Hermitian matrix or matrix pencil has many applications. A new density-matrix-based algorithm has been proposed recently and a software package FEAST has been developed. The density-matrix approach allows FEAST's implementation to exploit a key strength of modern computer architectures, namely, multiple levels of parallelism. Consequently, the software package has been well received, especially in the electronic structure community. Nevertheless, theoretical analysis of FEAST has lagged. For instance, the FEA…
