| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 710293 | IFAC-PapersOnLine | 2016 | 6 Pages |
Abstract
This paper deals with the characterization of flat outputs for structured linear discrete-time systems. More precisely, considering a structured discrete-time linear system, we provide a complete set of the flat outputs using constructive polynomial complexity order algorithms. The proposed method is simple to implement. It is based on usual algorithms dedicated to the computation of successors and predecessors of vertex subsets and to the computation and the ordering of strongly connected components in a digraph.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Taha Boukhobza, Gilles Millerioux,