Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\) (Q610436): Difference between revisions
From MaRDI portal
Latest revision as of 13:53, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\) |
scientific article |
Statements
Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \(AX+BY=E\overline{X}F+S\) (English)
0 references
8 December 2010
0 references
The authors consider the matrix equation given in the title and propose an iterative algorithm for solving the equation. By specifying the proposed algorithm, they give iterative algorithms for solving the normal Sylvester-conjugate matrix equation \(XF-A\overline X=C\), the Kalman-Yakubovich-conjugate matrix equation \(X - A\overline X F = C\), and the generalized Sylvester matrix equation \(AX+BY=EXF+S\). As illustration, two numerical examples are given.
0 references
finite iterative algorithms
0 references
generalized Sylvester-conjugate matrix equation
0 references
real inner product
0 references
orthogonality
0 references
Kalman-Yakubovich-conjugate matrix equation
0 references
numerical examples
0 references
generalized Sylvester matrix equation
0 references
0 references
0 references
0 references
0 references
0 references
