The solution of the equation AX + X^B =0
The authors describe how to find the general solution of the matrix equation \(A \, X + X^{\ast} \, B = 0\), where \(A \in \mathbb C^{m \times n}\) and \(B \in \mathbb C^{n \times m}\) are arbitrary matrices, \(X \in \mathbb C^{n \times m}\) is the unknown, and \(X^{\ast}\) denotes either the transpose or the conjugate transpose of \(X\). First, it is shown that the solution can be obtained in terms of the Kronecker canonical form of the matrix pencil \(A + \lambda \, B^{\ast}\) and the two nonsingular matrices that transform this pencil into its Kronecker canonical form. Also a complete description of the solution is given provided that these two matrices and the Kronecker canonical form of \(A + \lambda \, B^{\ast}\) are known. As a consequence, the dimension of the solution space of the equation is determined in terms of the sizes of the blocks appearing in the Kronecker canonical form of \(A + \lambda \, B^{\ast}\). The general solution of the homogeneous equation \(A \, X + X^{\ast} \, B = 0\) is essential to finding the general solution of \(A \, X + X^{\ast} \, B = C\), which is related to palindromic eigenvalue problems that have attracted considerable attention recently.
- A note on the matrix equation H=AP+PA**
- Canonical forms for complex matrix congruence and \(^{*}\)-congruence
- CLASSIFICATION PROBLEMS FOR SYSTEMS OF FORMS AND LINEAR MAPPINGS
- Explicit solution of the operator equation \(A^{*}X+X^{*}A=B\)
- scientific article; zbMATH DE number 6098827 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- Implicit QR algorithms for palindromic and even eigenvalue problems
- On the Matrix Equation $AX + X^ * A^ * = C$
- On the matrix function \(AX + X'A'\)
- Roth's theorems for matrix equations with symmetry constraints
- Structured Condition Numbers for Invariant Subspaces
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The computation of Kronecker's canonical form of a singular pencil
- The equation XA+AX^*=0 and the dimension of *congruence orbits
- The Equations ATX\pm XTA=B
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- The solution of the equation \(XA+AX^T=0\) and its application to the theory of orbits
- On a relationship between the \(\operatorname{T}\)-congruence Sylvester equation and the Lyapunov equation
- Matrices \(A\) such that \(A^{s+1}R\) = \(RA^\ast\) with \(R^k = I\)
- Fast verified computation for the solution of the T-congruence Sylvester equation
- Skew-symmetric matrix pencils: Codimension counts and the solution of a pair of matrix equations
- Solvability and uniqueness criteria for generalized Sylvester-type equations
- The structure of solutions of the matrix equation \(J_n(0)y + Y^\top J_n(0) = 0\) for even \(n\)
- On the structure of the solutions to the matrix equation G^ JG = J
- On the consistency of the matrix equation X^ A X=B when B is symmetric
- The solution to matrix equation \(AX+X^TC=B\)
- A computational framework of gradient flows for general linear matrix equations
- Note on solution of a linear equation Ax=b
- Projection methods for large-scale T-Sylvester equations
- On T-Sylvester equations over commutative rings
- The solution of the equation \(AX+BX^{\star}=0\)
- The equation XA+AX^*=0 and the dimension of *congruence orbits
- Backward errors and small-sample condition estimation for ⋆-Sylveter equations
- Computational Methods for Linear Matrix Equations
- The complete equivalence canonical form of four matrices over an arbitrary division ring
- Some new results on a system of Sylvester-type quaternion matrix equations
- Solving the Sylvester equation AX-XB=C when (A)(B)
- Two-sided coupled generalized Sylvester matrix equations solving using a simultaneous decomposition for fifteen matrices
- The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\)
- Investigation of some Sylvester-type quaternion matrix equations with multiple unknowns
- A new Sylvester-type quaternion matrix equation model for color image data transmission
- A system of quaternary coupled Sylvester-type real quaternion matrix equations
- The dimension of orbits and bundles of Hermitian pencils under -congruence
- Solvability and uniqueness of solution of generalized -Sylvester equations with arbitrary coefficients
- Solutions to the linear transpose matrix equations and their application in control
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
This page was built for publication: The solution of the equation \(AX + X^{\star}B =0\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940085)