.png){kind=icon}
.png){kind=icon}
Return
Periodic descriptor systems: Solvability and conditionability
.png){kind=icon}
PRE
AI
DOI：10.1109/9.746256.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The authors consider discrete-time linear periodic descriptor systems and study the concepts of solvability and conditionability, introduced by Luenberger. They prove that solvability is equivalent to conditionability, just as in the time-invariant case. We give a characterization of solvability/conditionability in terms of a cyclic matrix: pencil and, furthermore, propose a simple test,ia the periodic Schur decomposition to check for either property. This could lead to further systematic study of these systems.
Keywords:
descriptor systems
periodic systems
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
No organization information available