Minimal Realizations of Linear Systems: The "Shortest Basis" Approach
Given a discrete-time linear system C, a shortest basis for C is a set of linearly independent generators for C with the least possible lengths. A basis B is a shortest basis if and only if it has the predictable span property (i.e., has the predictable delay and degree properties, and is non-catast...
Main Author: | Forney, G. David, Jr. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73076 |
Similar Items
-
Minimal Realization Problems for Jump Linear Systems
by: Sarkar, Tuhin, et al.
Published: (2019) -
DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
by: Ahuja, Ravindra, et al.
Published: (2003) -
Compound soap bubbles, shortest networks and minimal surfaces / [kasetvideo]
by: 190027 Morgan, Frank, et al.
Published: (1992) -
Minimal realizations of interconnected dynamical systems
by: Fausto Posso
Published: (2010-11-01) -
Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity
by: Sara Santos, et al.
Published: (2023-01-01)