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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
