Subspace Identification for Linear Systems
Published 1 January 1996
Peter Van Overschee, Bart De Moor
Citations2,555
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Subspace Identification for Linear Systems focuses on the theory, implementation and applications of subspace identification algorithms for linear time-invariant finite- dimensional dynamical systems.
Keywords
EngineeringPhysics and Astronomy
IEEE Transactions on Automatic ControlPrincipal component analysis in linear systems: Controllability, observability, and model reduction
5,275 Citations1981B. Moore
PsychometrikaThe Approximation of One Matrix by Another of Lower Rank
3,795 Citations1936Carl Eckart, Gale Young
Digital control of dynamic systems
3,195 Citations1980Gene F. Franklin, M. L. Workman +1 more
This well-respected, market-leading text discusses the use of digital computers in the real-time control of dynamic systems and thoroughly integrates MATLAB statements and problems to offer readers a complete design picture.
AutomaticaComputer controlled systems theory and design
3,014 Citations1986
This volume focuses on the design of computer-controlled systems, featuring computational tools that can be applied directly and are explained with simple paper-and-pencil calculations.
International Journal of ControlAll optimal Hankel-norm approximations of linear multivariable systems and their<i>L</i>,<sup>∞</sup>-error bounds†
2,859 Citations1984K. Glover
AutomaticaN4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems
1,964 Citations1994Peter Van Overschee, Bart De Moor
Two new N4SID algorithms to identify mixed deterministic-stochastic systems are derived and these new algorithms are compared with existing subspace algorithms in theory and in practice.
IEEE Transactions on Circuits and SystemsKronecker products and matrix calculus in system theory
1,896 Citations1978John Brewer
The calculus of matrix valued functions of matrices is used to develop an interesting new method for the identifiication of parameters of lnear time-invariant system models.
IEEE Transactions on Automatic ControlA Schur method for solving algebraic Riccati equations
1,001 Citations1979Alan J. Laub
NASA Technical Reports Server (NASA)Effective construction of linear state-variable models from input/output functions.
814 Citations1965B. L. Ho, R. E. Kalman
TechnometricsThe Statistical Theory of Linear Systems
764 Citations1990Jonathan D. Cryer, E. J. Hannan +1 more
IEEE Transactions on Signal ProcessingSensor array processing based on subspace fitting
700 Citations1991Mats Viberg, Björn Ottersten
It is shown that by introducing a specific weighting matrix, the multidimensional signal subspace method can achieve the same asymptotic properties as the ML method.
IEEE Transactions on Automatic ControlCanonical forms for linear multivariable systems
692 Citations1967David G. Luenberger
IEEE Transactions on Automatic ControlStochastic theory of minimal realization
426 Citations1974Hirotugu Akaike
Cambridge University Press eBooksTHEORIA MOTUS CORPORUM COELESTIUM IN SECTIONIBUS CONICIS SOLEM AMBIENTIUM
373 Citations2011Carolo Friderico Gauss
SIAM Journal on ControlMarkovian Representation of Stochastic Processes by Canonical Variables
356 Citations1975Hirotugu Akaike
The structure of the information interface between the future and the past of a discrete-time stochastic process is analyzed by using the concepts of canonical correlation analysis and two extreme Markovian representations are obtained.
AutomaticaFrom time series to linear system—Part III
333 Citations1987Jan C. Willems
The problem of finding a linear time invariant complete system which models an observed time series will be continued, however, in this part it will be assumed that the model is required to explain the observations only approximately, and what is meant by an approximate model is raised.
IEEE Transactions on Automatic ControlRealization of linear dynamical systems
271 Citations1971L. Silverman
Essays on control : perspectives in the theory and its applications
268 Citations1993Harry L. Trentelman, Jan C. Willems
Information, Knowledge and Control A.G. van der Schaft Learning Control and Related Problems in Infinite-Dimensional Systems Y. Yamamoto An Algebraic Approach to Linear and Nonlinear Control M.M. Morari Engineering Aspects of Industrial Applications of Model-Based Control Techniques and System Theory.
IEEE Transactions on Automatic ControlA transformation approach to stochastic model reduction
245 Citations1984U.B. Desai, Debajyoti Pal
Systems & Control LettersA regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L∞-norm
230 Citations1990Stephen Boyd, V. Balakrishnan
IEEE Transactions on Automatic ControlApproximate linear realizations of given dimension via Ho's algorithm
225 Citations1974H. Paul Zeiger, A. S. McEwen
A variant of the Ho's Algorithm that generates approximate realizations of specified dimension from approximate data is discussed.
Proceedings of the IEEEModel based processing of signals: a state space approach
223 Citations1992Bhaskar D. Rao, K.S. Arun
It is shown that state space models provide an elegant tool for exposing the structure present in the problem and allows for robust parameterization of the model with respect to finite precision errors.
Bulletin de la Société mathématique de FranceEssai sur la géométrie à $n$ dimensions
215 Citations1875Camille Jordan
Mathematics in Science and Engineering/Mathematics in science and engineeringStochastic Realization Algorithms
166 Citations1976Pierre Faurre
This chapter deals with the theoretical problem of studying all Markovian models corresponding to a given stochastic process, and the related constructing proofs also lead to the design of efficient algorithms.
AutomaticaApplication of a subspace model identification technique to identify LTI systems operating in closed-loop
157 Citations1993Michel Verhaegen
This paper reformulate the identification of linear time-invariant systems operating in a closed-loop with an LTI compensator to an open-loop multi-input-multi-output (MIMO) (state space model) identification problem, followed by a model reduction step.
IEEE Transactions on Automatic ControlAn error bound for a discrete reduced order model of a linear multivariable system
130 Citations1987Ubaid M. Al‐Saggaf, G.F. Franklin
An Linftybound is derived for model error for a method of order reduction of discrete linear multivariable systems based on balancing for continuous-time systems for algorithmsbased on balancing.
SIAM ReviewTotal Least Squares: State-of-the-Art Regression in Numerical Analysis
120 Citations1994Yves Nievergelt
The elementary algorithm presented here fits readily in a first course in numerical linear algebra and is suitable for use in research on total least squares regression.
International Journal of ControlA realization approach to stochastic model reduction
105 Citations1985Uday B. Desai, Debajyoti Pal +1 more
IEEE Transactions on Automatic ControlA minimal realization algorithm for matrix sequences
101 Citations1974B. Dickinson, M. Morf +1 more
IEEE Transactions on Automatic ControlCanonical matrix fraction and state-space descriptions for deterministic and stochastic linear systems
92 Citations1974B. Dickinson, T. Kailath +1 more
The important case of autoregressive processes is studied and it is shown how the Chandrasekhar-type equations can be used to obtain and generalize the well known Levinson-Wiggins-Robinson (LWR) recursion for estimation of stationary autore progressive processes.
AutomaticaFast recursive identification of state space models via exploitation of displacement structure
86 Citations1994Young Man Cho, Guanghan Xu +1 more
The results of the batch processing algorithm are extended to allow updating of the identified state space model with O ( M 2 ) flops and the theories of displacement structure and of the fast subspace decomposition (FSD) technique play crucial roles in the realization of thefast updating algorithm.
IEEE Transactions on Automatic ControlMinimal realization of discrete linear systems from input-output observations
85 Citations1971M. Budin
SIAM Journal on Matrix Analysis and ApplicationsBalanced Approximation of Stochastic Systems
69 Citations1990K.S. Arun, Sun‐Yuan Kung
First generalizations of balanced model reduction to the stochastic system approximation problem are presented and the ideas of principal components to the problem of approximating the information interface between two random vectors are generalized; this leads to three approximate stochastically realization methods based on singular value decomposi...
Trends in Control
49 Citations1995
From the combination of knowledge and actions, someone can improve their skill and ability and this will lead them to live and work much better.
A geometrical approach for the identification of state space models with singular value decomposition
45 Citations2003Bart De Moor, Marc Moonen +2 more
It is shown how the singular value decomposition allows the order of the observable part of the system and its state-space model matrices to be estimated and an example with an industrial plant identification is presented.
IFAC Proceedings VolumesA Novel Non-Iterative Mimo State Space Model Identification Technique
37 Citations1991Michel Verhaegen
The usefulness of this extension of MOESP, standing for MIMO Output-Error State space model identification, algorithms is demonstrated in the identification of the longitudinal aircraft dynamics using (simulated) flight test data recorded when flying through a vertical gusty wind field.
4SID linear regression
22 Citations2002Bo Wahlberg, Magnus Jansson
The conclusion is that 4SID can be viewed as a linear regression multistep ahead prediction error method, with certain rank constraints, within the standard framework of system identification and linear regression estimation.
IFAC Proceedings VolumesA Subspace Based Instrumental Variable Method for State-Space System Identification
21 Citations1994Björn Ottersten, Mats Viberg
A subspace based technique for identifying general finite-dimensional linear systems is presented and analyzed and based on a statistical analysis, an optimal weighting derived.
IFAC Proceedings VolumesComparison of Three Classes of Identification Methods
21 Citations1994Yucai Zhu, Peter Van Overschee +2 more
Generalized frequency weighted balanced reduction
15 Citations2005P.M.R. Wortelboer, О.H. Bosgra
A simple start-up procedure for canonical form state space identification, based on subspace approximation
14 Citations2002Lennart Ljung
Lecture notes in control and information sciencesThe application of the canonical correlation concept to the identification of linear state space models
8 Citations1988Bart De Moor, Moonen Marc +2 more
International Journal of ControlComments on 'State-space model identification with data correlation’
5 Citations1992Marc Moonen, Bart De Moor
It is pointed out that neither one of these methods really applies to the examples given in the paper, and an outline of a method which should be used instead is given.
IFAC Proceedings VolumesA Study of Some Approaches to Vibration Data Analysis
3 Citations1994Thomas Abrahamsson, Tomas McKelvey +1 more
Using data from extensive vibrational tests of the new aircraft Saab 2000 three different methods for vibration analysis are studied and it is found that both the ERA and N4SID methods give good initial model parameter estimates that can be further improved by the use of PEM.
A state-space approach to positive sequences
3 Citations2005R.J. Vaccaro, Fu Li
A solution to the positivity problem is given which uses state-space models and a scaled algebraic Riccati equation.