Explicit solution of the matrix equation \(AXB-CXD=E\) (Q1824013): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3901612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finite Series Solution of the Matrix Equation $AX - XB = C$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Equation $AXB + CXD = E$ / rank
 
Normal rank

Latest revision as of 09:51, 20 June 2024

scientific article
Language Label Description Also known as
English
Explicit solution of the matrix equation \(AXB-CXD=E\)
scientific article

    Statements

    Explicit solution of the matrix equation \(AXB-CXD=E\) (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The authors consider the unique solution of the matrix equation (1) \(AXB- CXD=E\) where \(X\in {\mathbb{K}}^{n\times p}\) is an unknown matrix and \(A,C\in {\mathbb{K}}^{m\times n}\), \(B,D\in {\mathbb{K}}^{p\times q}\), \(E\in {\mathbb{K}}^{n\times p}\) \(({\mathbb{K}}={\mathbb{R}}\) or \({\mathbb{C}})\). Note that equation (1) is equivalent to \((2)\quad (\lambda C-A)XB-CX(\lambda B-D)=- E.\) In Section 2, when \(m=n\), \(p=q\) and B or C is nonsingular, a theoretical approach to the solution of (1) is presented on the basis of the relative Cayley-Hamilton theorem. Under hypothesis (i) the pencils \(\lambda\) C-A and \(\lambda\) B-D are regular, and (ii) the spectra of these pencils have an empty intersection, the unique solution is obtained by means of the inversion of an \(m\times m\) and \(p\times p\) matrix. This paper is strongly influenced by \textit{A. Jameson}'s work [SIAM J. Appl. Math. 16, 1020-1023 (1968; Zbl 0169.352)]. Section 3 deals with the case of singular pencils. It is shown that if (iii) the pencils \(\lambda\) C-A and \(\lambda\) B-D are right and left invertible, respectively, and (iv) they have disjoint spectra, then the equation (1) has a solution. The proof is based on the reduction to the case of regular pencils by using the same technique applied \textit{P. Van Dooren} [Lecture Notes Math. 973, 58-73 (1983; Zbl 0517.65022)] to the matrix equation in Y and Z \((\lambda C-A)Y-Z(\lambda B-D)=\lambda F-E.\)
    0 references
    Sylvester equation
    0 references
    Lyapunov equation
    0 references
    matrix pencil
    0 references
    matrix equation
    0 references
    Cayley-Hamilton theorem
    0 references
    singular pencils
    0 references

    Identifiers