The solution of the equation \(AX + X^{\star}B =0\)
From MaRDI portal
Publication:1940085
DOI10.1016/j.laa.2012.11.014zbMath1264.15016MaRDI QIDQ1940085
Daniel Montealegre, Froilán M. Dopico, Fernando De Terán, Nathan Guillery, Nicolás Ruiz Reyes
Publication date: 5 March 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.11.014
matrix equation; matrix pencils; Kronecker canonical form; palindromic eigenvalue problems; Sylvester equation for \(\ast\) congruence
15A24: Matrix equations and identities
15A18: Eigenvalues, singular values, and eigenvectors
15A21: Canonical forms, reductions, classification
15A22: Matrix pencils
Related Items
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 $\sigma(A)\cap\sigma(B)\neq\emptyset$, Two-sided coupled generalized Sylvester matrix equations solving using a simultaneous decomposition for fifteen matrices, On T-Sylvester equations over commutative rings, A system of quaternary coupled Sylvester-type real quaternion matrix equations, Solutions to the linear transpose matrix equations and their application in control, Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation, 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, On the consistency of the matrix equation \(X^\top A X=B\) when \(B\) is symmetric, A computational framework of gradient flows for general linear matrix equations, Projection methods for large-scale T-Sylvester equations, Backward errors and small-sample condition estimation for ⋆-Sylveter equations, Computational Methods for Linear Matrix Equations
Cites Work
- The solution of the equation \(XA+AX^T=0\) and its application to the theory of orbits
- The computation of Kronecker's canonical form of a singular pencil
- On the matrix function \(AX + X'A'\)
- Explicit solution of the operator equation \(A^{*}X+X^{*}A=B\)
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Roth's theorems for matrix equations with symmetry constraints
- Canonical forms for complex matrix congruence and \(^{*}\)-congruence
- A note on the matrix equation \(H=AP+PA**\)
- On the Matrix Equation $AX + X^ * A^ * = C$
- Structured Condition Numbers for Invariant Subspaces
- CLASSIFICATION PROBLEMS FOR SYSTEMS OF FORMS AND LINEAR MAPPINGS
- 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
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item