### Iterative Hermitian R-Conjugate Solutions to General Coupled Sylvester Matrix Equations

#### Abstract

For given symmetric orthogonal matrix $R$, i.e., $R^{T}=R$,

$R^{2}=I$, a matrix $A\in \mathbb{C}^{n\times n}$ is termed

Hermitian R-conjugate matrix if $A=A^{H}$, $RAR=\overline{A}$. In this paper, an iterative method is constructed for finding

the Hermitian R-conjugate solutions of general coupled Sylvester matrix equations. Convergence analysis shows that the presented method is always convergent for any initial Hermitian R-conjugate matrix group for a loose restriction on the convergent factor. Meanwhile, the optimal convergent factor is also derived. Finally, two numerical examples are given to demonstrate the theoretical results and effectiveness.

$R^{2}=I$, a matrix $A\in \mathbb{C}^{n\times n}$ is termed

Hermitian R-conjugate matrix if $A=A^{H}$, $RAR=\overline{A}$. In this paper, an iterative method is constructed for finding

the Hermitian R-conjugate solutions of general coupled Sylvester matrix equations. Convergence analysis shows that the presented method is always convergent for any initial Hermitian R-conjugate matrix group for a loose restriction on the convergent factor. Meanwhile, the optimal convergent factor is also derived. Finally, two numerical examples are given to demonstrate the theoretical results and effectiveness.

#### Full Text:

PDF### Refbacks

- There are currently no refbacks.