We consider the uniqueness of solution (i.e., nonsingularity) of systems of r generalized Sylvester and -Sylvester equations with nxn 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(n(3)r) algorithm for computing the (unique) solution.
Nonsingular systems of generalized Sylvester equations: An algorithmic approach
Robol L
2019
Abstract
We consider the uniqueness of solution (i.e., nonsingularity) of systems of r generalized Sylvester and -Sylvester equations with nxn 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(n(3)r) algorithm for computing the (unique) solution.File | Dimensione | Formato | |
---|---|---|---|
prod_424803-doc_151512.pdf
accesso aperto
Descrizione: Nonsingular systems of generalized Sylvester equations: An algorithmic approach
Tipologia:
Versione Editoriale (PDF)
Dimensione
559.62 kB
Formato
Adobe PDF
|
559.62 kB | Adobe PDF | Visualizza/Apri |
prod_424803-doc_151532.pdf
non disponibili
Descrizione: Nonsingular systems of generalized Sylvester equations: An algorithmic approach
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.07 MB
Formato
Adobe PDF
|
1.07 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.