An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation (Q942379)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation |
scientific article; zbMATH DE number 5321648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation |
scientific article; zbMATH DE number 5321648 |
Statements
An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation (English)
0 references
5 September 2008
0 references
A real matrix A of order \(n\) is reflexive with respect to a real matrix \(P\) if \(A=PAP\), where \(P\) is symmetric and involutory. An iterative algorithm for the generalized coupled Sylvester matrix equations over reflexive matrices is considered. The method is used to obtain a reflexive solution pair and under certain conditions the least Frobenius norm reflexive solution pair can also be computed. Some examples illustrate the presentation.
0 references
Sylvester matrix equation
0 references
reflexive matrix
0 references
Frobenius norm
0 references
matrix iterative method
0 references
numerical examples
0 references
Kronecker matrix product
0 references
reflexive solution pair
0 references
0 references
0 references
0 references
0 references
0.9619640707969666
0 references
0.9571652412414552
0 references
0.9448348879814148
0 references
0.942807674407959
0 references
