abstract bibtex

The family of m-input, n-dimensional linear systems can be globally Identified with a generic input sequence of length 2mn. This bound is the best possible. A best bound is proved also for a corresponding local identification problem.

@ARTICLE{MR561358, AUTHOR = {E.D. Sontag}, JOURNAL = {IEEE Trans. Automat. Control}, TITLE = {On the length of inputs necessary in order to identify a deterministic linear system}, YEAR = {1980}, OPTMONTH = {}, OPTNOTE = {}, NUMBER = {1}, PAGES = {120--121}, VOLUME = {25}, PDF = {../../FTPDIR/80tac-number-inputs.pdf}, ABSTRACT = { The family of m-input, n-dimensional linear systems can be globally Identified with a generic input sequence of length 2mn. This bound is the best possible. A best bound is proved also for a corresponding local identification problem. } }

Downloads: 0