The iterative solution of the matrix equation \(XA+BX+C=0\) (Q1114306): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90008-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004054427 / rank
 
Normal rank

Revision as of 00:47, 20 March 2024

scientific article
Language Label Description Also known as
English
The iterative solution of the matrix equation \(XA+BX+C=0\)
scientific article

    Statements

    The iterative solution of the matrix equation \(XA+BX+C=0\) (English)
    0 references
    1988
    0 references
    The paper deals with the linear matrix equation \(XA+BX+C=0\) in the unknown matrix X. The aim is to present a unified theory for the iterative solution of this equation. Two well known iterative algorithms, converging when A and B are stable, are realized as special cases of the proposed unified method. The convergence of the unified algorithm does not depend on the stability of A and B, but occurs whenever the matrix equation has a unique solution. Finally, a theoretical algorithm based on a matrix polynomial is presented; it requires the construction of characteristic or interpolating polynomials.
    0 references
    Lyapunov equation
    0 references
    linear matrix equation
    0 references
    iterative algorithms
    0 references
    convergence
    0 references
    stability
    0 references
    matrix polynomial
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references