This paper proposes the modified generalization of the HSS (MGHSS) to solve a large and sparse continuous Sylvester equation, improving the efficiency and robustness. The analysis shows that the MGHSS converges to the unique solution of AX + XB = C unconditionally. We also propose an inexact variant of the MGHSS (IMGHSS) and prove its convergence under certain conditions. Numerical experiments verify the efficiency of the proposed methods
In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solvin...
AbstractThe generalized coupled Sylvester systems play a fundamental role in wide applications in se...
This paper is devoted to the perturbation analysis for a projected generalized continuous-time Sylve...
Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a genera...
We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse...
In this paper we propose a parallel two-stage iteration algorithm for solving large-scale continuous...
In this paper, we propose a direct method based on the real Schur factorization for solving the proj...
Many problems in applied mathematics can be formulated as a Sylvester matrix equation AX+XB=C. Itera...
We present and analyze a new iterative scheme for large-scale solution of the well-known Sylvester e...
We discuss convergence properties of the GMRES and FOM methods for solving large Sylvester equations...
We consider the solution of the?-Sylvester equations AX±X?B? = C, for? = T,H and A,B, ∈ Cn×n, and ...
AbstractIn Part I of this article, we proposed a finite iterative algorithm for the one-sided and ge...
By analyzing the eigenvalues of the related matrices, the convergence analysis of the least squares ...
AbstractWe describe Galerkin and minimal residual algorithms for the solution of Sylvester's equatio...
This paper is concerned with a parallel solution of the Sylvester matrix equation AX+XB=C by means o...
In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solvin...
AbstractThe generalized coupled Sylvester systems play a fundamental role in wide applications in se...
This paper is devoted to the perturbation analysis for a projected generalized continuous-time Sylve...
Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a genera...
We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse...
In this paper we propose a parallel two-stage iteration algorithm for solving large-scale continuous...
In this paper, we propose a direct method based on the real Schur factorization for solving the proj...
Many problems in applied mathematics can be formulated as a Sylvester matrix equation AX+XB=C. Itera...
We present and analyze a new iterative scheme for large-scale solution of the well-known Sylvester e...
We discuss convergence properties of the GMRES and FOM methods for solving large Sylvester equations...
We consider the solution of the?-Sylvester equations AX±X?B? = C, for? = T,H and A,B, ∈ Cn×n, and ...
AbstractIn Part I of this article, we proposed a finite iterative algorithm for the one-sided and ge...
By analyzing the eigenvalues of the related matrices, the convergence analysis of the least squares ...
AbstractWe describe Galerkin and minimal residual algorithms for the solution of Sylvester's equatio...
This paper is concerned with a parallel solution of the Sylvester matrix equation AX+XB=C by means o...
In this paper, we present two different relaxed gradient based iterative (RGI) algorithms for solvin...
AbstractThe generalized coupled Sylvester systems play a fundamental role in wide applications in se...
This paper is devoted to the perturbation analysis for a projected generalized continuous-time Sylve...