Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation

DOI10.1016/j.laa.2015.11.037zbMath1329.15034OpenAlexW2208530444MaRDI QIDQ905721

Bruno Iannazzo, Fernando De Terán

Publication date: 28 January 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.11.037

zbMATH Keywords

eigenvaluesSylvester equationmatrix pencillinear matrix equation\(\star\)-Stein equation\(\star\)-Sylvester equation\(T\)-Sylvester equation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix equations and identities (15A24) Matrix pencils (15A22)

Related Items

Backward errors and small-sample condition estimation for ⋆-Sylveter equations ⋮ A note on the solvability for generalized Sylvester equations ⋮ Precision matrix estimation using penalized generalized Sylvester matrix equation ⋮ The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\) ⋮ A System of Periodic Discrete-time Coupled Sylvester Quaternion Matrix Equations ⋮ On the consistency of the matrix equation \(X^\top A X=B\) when \(B\) is symmetric ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ Lopsided DSS iteration method for solving complex Sylvester matrix equation ⋮ Solvability and uniqueness criteria for generalized Sylvester-type equations ⋮ Corrigendum to: ``Solvability and uniqueness criteria for generalized Sylvester-type equations ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ On a transformation of the ∗-congruence Sylvester equation for the least squares optimization ⋮ Palindromic linearization and numerical solution of nonsymmetric algebraic \(T\)-Riccati equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
• An efficient algorithm for solving extended Sylvester-conjugate transpose matrix equations
• Least squares solution with the minimum-norm to general matrix equations via iteration
• Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
• Gradient based iterative solutions for general linear matrix equations
• Implicit QR algorithms for palindromic and even eigenvalue problems
• The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\)
• Roth's theorems for matrix equations with symmetry constraints
• The matrix equation \(X + AX^TB = C\): Conditions for unique solvability and a numerical algorithm for its solution
• The solution of the equation \(AX + X^{\star}B =0\)
• A note on the \(\top\)-Stein matrix equation
• A computational framework of gradient flows for general linear matrix equations
• The solution of the equationAX + BX^⋆ = 0
• Structured Condition Numbers for Invariant Subspaces
• Coupled Sylvester-type Matrix Equations and Block Diagonalization
• The Equations AX - YB = C and AX - XB = C in Matrices