Publication:
Nonsingular systems of generalized Sylvester equations: An algorithmic approach

Thumbnail Image
Identifiers
URI: http://hdl.handle.net/10016/31725
ISSN: 1070-5325
DOI: https://doi.org/10.1002/nla.2261
UXXI: AR/0000024546
Files
nonsingular_NL_2019_ps.pdf (677.82 KB)
Publication date
2019-01-01
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
John Wiley & Sons
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
We consider the uniqueness of solution (i.e., nonsingularity) of systems of r generalized Sylvester and ⋆‐Sylvester equations with n×n coefficients. After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized ⋆‐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(n3r) algorithm for computing the (unique) solution.
Description
Keywords
Formal matrix product, Matrix pencils, Periodic QR/QZ algorithm, Periodic Schur decomposition, Sylvester and ⋆‐Sylvester equations, Systems of linear matrix equations
Bibliographic citation
De Terán, F, Iannazzo, B, Poloni, F, Robol, L. Nonsingular systems of generalized Sylvester equations: An algorithmic approach. Numer Linear Algebra Appl. 2019; 26:e2261
Collections
DM - AMCSS - Artículos de Revistas