DeepAI AI Chat
Log In Sign Up

A class of multiplicative splitting iterations for solving the continuous Sylvester equation

by   Yu Huang, et al.
Ferdowsi University of Mashhad

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 splitting of the Jacobi iterations for matrices A and B, in the second equation in the multiplicative splitting iteration method. Convergence conditions of this method are studied and numerical experiments show the efficiency of this method.


page 1

page 2

page 3

page 4


On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations

We present a circulant and skew-circulant splitting (CSCS) iterative met...

Robust iteration methods for complex systems with an indefinite matrix term

Complex valued systems with an indefinite matrix term arise in important...

Analysis of the multiplicative Schwarz method for matrices with a special block structure

We analyze the convergence of the (algebraic) multiplicative Schwarz met...

A semi-conjugate gradient method for solving unsymmetric positive definite linear systems

The conjugate gradient (CG) method is a classic Krylov subspace method f...

On the Forsythe conjecture

Forsythe formulated a conjecture about the asymptotic behavior of the re...

On the stability and performance of the solution of sparse linear systems by partitioned procedures

In this paper, we present, evaluate and analyse the performance of paral...