Nonsingular systems of generalized Sylvester equations: an algorithmic approach
Preprint
Abstract
We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized $\star$-Sylvester equation. We provide characterizations for the nonsingularity in terms of spectral properties of either matrix pencils or formal matrix products, both constructed from the coefficients of the system. The proposed approach uses the periodic Schur decomposition, and leads to a backward stable $O(n^3r)$ algorithm for computing the (unique) solution.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Solvability and uniqueness criteria for generalized Sylvester-type equationsLinear Algebra and its Applications, 2018
- Generalization of Roth's solvability criteria to systems of matrix equationsLinear Algebra and its Applications, 2017
- A comparative study of null‐space factorizations for sparse symmetric saddle point systemsNumerical Linear Algebra with Applications, 2017
- Complex Conjugate Matrix Equations for Systems and Control2017
- Uniqueness of solution of a generalized ⋆-Sylvester matrix equationLinear Algebra and its Applications, 2016
- Implicit QR algorithms for palindromic and even eigenvalue problemsNumerical Algorithms, 2008
- Computing periodic deflating subspaces associated with a specified set of eigenvaluesBIT Numerical Mathematics, 2007
- Kronecker bases for linear matrix equations, with application to two-parameter eigenvalue problemsLinear Algebra and its Applications, 1996
- On swapping diagonal blocks in real Schur formLinear Algebra and its Applications, 1993
- Perturbation theory and backward error forAX−XB=CBIT Numerical Mathematics, 1993