An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation (Q942379)

From MaRDI portal
Revision as of 23:43, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
scientific article

    Statements

    An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation (English)
    0 references
    0 references
    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
    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

    Identifiers