On the length of inputs necessary in order to identify a deterministic linear system

On the length of inputs necessary in order to identify a deterministic linear system. Sontag, E. IEEE Trans. Automat. Control, 25(1):120–121, 1980.
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

{"_id":"itGfdMFHLtvrinxLP","bibbaseid":"sontag-onthelengthofinputsnecessaryinordertoidentifyadeterministiclinearsystem-1980","downloads":0,"creationDate":"2018-10-18T05:07:06.735Z","title":"On the length of inputs necessary in order to identify a deterministic linear system","author_short":["Sontag, E."],"year":1980,"bibtype":"article","biburl":"http://www.sontaglab.org/PUBDIR/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["E.D."],"propositions":[],"lastnames":["Sontag"],"suffixes":[]}],"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. ","bibtex":"@ARTICLE{MR561358,\n AUTHOR = {E.D. Sontag},\n JOURNAL = {IEEE Trans. Automat. Control},\n TITLE = {On the length of inputs necessary in order to identify a \n deterministic linear system},\n YEAR = {1980},\n OPTMONTH = {},\n OPTNOTE = {},\n NUMBER = {1},\n PAGES = {120--121},\n VOLUME = {25},\n PDF = {../../FTPDIR/80tac-number-inputs.pdf},\n ABSTRACT = { The family of m-input, n-dimensional linear systems can \n be globally Identified with a generic input sequence of length 2mn. \n This bound is the best possible. A best bound is proved also for a \n corresponding local identification problem. }\n}\n\n","author_short":["Sontag, E."],"key":"MR561358","id":"MR561358","bibbaseid":"sontag-onthelengthofinputsnecessaryinordertoidentifyadeterministiclinearsystem-1980","role":"author","urls":{},"downloads":0,"html":""},"search_terms":["length","inputs","necessary","order","identify","deterministic","linear","system","sontag"],"keywords":[],"authorIDs":["5bc814f9db768e100000015a"],"dataSources":["DKqZbTmd7peqE4THw"]}