Constrained matrix Sylvester equations

The problem of finding matrices $L$ and $T$ satisfying $TA - FT = LC$ and $TB = 0$ is considered. Existence conditions for the solution are established and an algorithm for computing the solution is derived. Conditions under which the matrix $[C^T ,T^T ]$ is full rank are also discussed. The problem...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on matrix analysis and applications 1992, Vol.13 (1), p.1-9
Hauptverfasser:	BARLOW, J. B, MONAHEMI, M. M, O'LEARY, D. P
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Control theory Eigenvalues Exact sciences and technology Linear algebra Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The problem of finding matrices $L$ and $T$ satisfying $TA - FT = LC$ and $TB = 0$ is considered. Existence conditions for the solution are established and an algorithm for computing the solution is derived. Conditions under which the matrix $[C^T ,T^T ]$ is full rank are also discussed. The problem arises in control theory in the design of reduced-order observers that achieve loop transfer recovery.
ISSN:	0895-4798 1095-7162
DOI:	10.1137/0613002