Nonsingular systems of generalized Sylvester equations: an algorithmic approach

Authors:
  • FTFernando De Terán
    Fernando De Terán
  • BIBruno Iannazzo
    Bruno Iannazzo
  • FPFederico Poloni
    Federico Poloni
  • LRLeonardo Robol
    Leonardo Robol

Abstract
We consider the uniqueness of solution (nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficient matrices. 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 an $O(n^3r)$ algorithm for computing the (unique) solution. We prove that the proposed algorithm is backward stable. The asymptotic cost and the stability are then verified by some numerical experiments.