The iterative solution of the matrix equation \(XA+BX+C=0\) (Q1114306)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 4084852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The iterative solution of the matrix equation \(XA+BX+C=0\) |
scientific article; zbMATH DE number 4084852 |
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.8611511588096619
0 references
0.8436459302902222
0 references
0.8286662101745605
0 references
0.8281374573707581
0 references
