scientific article; zbMATH DE number 1090982

From MaRDI portal
Publication:4366804





Subspace identification algorithms are based on concepts from system theory, linear algebra and statistics. The main conceptual novelties in this area are: -- The state of a dynamical system is emphasized in the context of system identification, whereas ``classical approaches are based on an input-output framework. An important achievement of the research in subspace identification is to demonstrate how the Kalman filter can be obtained from input-output data using linear algebra tools. Once these states are known the identification problem becomes a linear least squares problem in the unknown system matrices. The subspace identification algorithms conditionally linearize the problem and they identify input-state-output models. -- The authors make full use in this book of well developed concepts and algorithms coming from linear algebra. -- The authors' approach provides a geometric framework. Combined deterministic-stochastic system identification problems can be treated with the same geometric concepts and algorithms. This simplicity is an advantage over the classical prediction error approach. -- The conceptual straightforwardness of subspace identification algorithms allows user-friendly software implementations. To do that, the authors use tools coming from linear algebra: the QR and Singular Value decomposition. I recommend this book being clearly written and containing a lot of implementations and applications.




Cited in
(only showing first 100 items - show all)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366804)