Premium
A RECURSIVE 4SID FROM THE INPUT‐OUTPUT POINT OF VIEW
Author(s) -
Oku Hiroshi,
Kimura Hidenori
Publication year - 1999
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1111/j.1934-6093.1999.tb00024.x
Subject(s) - mimo , subspace topology , mathematics , multivariable calculus , algorithm , lemma (botany) , control theory (sociology) , lti system theory , system identification , state space representation , state space , extension (predicate logic) , computer science , linear system , artificial intelligence , beamforming , mathematical analysis , ecology , statistics , poaceae , control (management) , control engineering , database , engineering , biology , measure (data warehouse) , programming language
In this paper, recursive algorithms of subspace state‐space system identification (4SID) for multiple‐input, multiple‐output (MIMO), finite dimensional, linear time‐invariant (FDLTI) systems are proposed. These algorithms are derived based on the Matrix Inversion Lemma. The investigation of our algorithms clarifies that a series of 4SID is the extension of the classical least square method to identification for multivariable systems, and also that our algorithms are the direct extension of the recursive least square algorithm to such ones. For PO‐MOESP (the ordinary MOESP scheme with instrumental variables constructed from Past input and Output measurements), we show the mechanism of how the effect of the process and measurement noises is eliminated asymptotically by a projection related to the input and regressor matrices. “MOESP” is an abbreviation for “the MIMO output‐error state‐space model identification.”