Algorithms for deterministic balanced subspace identification

@article{Markovsky2005AlgorithmsFD,
  title={Algorithms for deterministic balanced subspace identification},
  author={I. Markovsky and J. Willems and P. Rapisarda and B. Moor},
  journal={Autom.},
  year={2005},
  volume={41},
  pages={755-766}
}
New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero input responses directly from data. The proposed algorithms are more efficient than the existing alternatives that compute the whole Hankel matrix of Markov parameters. It is shown that the computations can be performed on Hankel matrices of the input-output data of various dimensions. By choosing wider matrices, we… Expand
A novel recursive subspace identification approach of closed-loop systems
In this paper, a subspace model identification method under closed-loop experimental condition is presented which can be implemented to recursively identify and update the system model. The projectedExpand
Structured low-rank approximation and its applications
TLDR
This work outlines applications in system theory (approximate realization, model reduction, output error, and errors-in-variables identification), signal processing, signal processing (harmonic retrieval, sum-of-damped exponentials, and finite impulse response modeling), and computer algebra (Approximate common divisor). Expand
Consistent Impulse-Response Estimation and System Realization From Noisy Data
TLDR
A novel method for the estimation of a finite part of the impulse response and the combination of Kung's realization algorithm yields a consistent system identification algorithm that is particularly useful for the identification of systems with uncoupled deterministic and stochastic dynamics. Expand
Role of LQ Decomposition in Subspace Identification Methods
We revisit the deterministic subspace identification methods for discrete-time LTI systems, and show that each column vector of the L-matrix of the LQ decomposition in MOESP and N4SID methods is aExpand
A data-driven predictive controller design based on reduced Hankel matrix
  • Hua Yang, Shaoyuan Li
  • Mathematics, Computer Science
  • 2015 10th Asian Control Conference (ASCC)
  • 2015
TLDR
A data-driven predictive control methodology based on reduced Hankel matrix is proposed and MPC formulations and optimization are presented, avoiding model identification or any intermediate step to meet the given performance specifications. Expand
Identifiability in the Behavioral Setting
The behavioral approach to system identification starts from a given time series without a priori separation of the variables into inputs and outputs. The available identifiability conditions howeverExpand
DATA DRIVEN SIMULATION WITH APPLICATIONS TO SYSTEM IDENTIFICATION
Abstract We present an iterative algorithm for computation of linear time-invariant system responses directly from an exact finite input/output trajectory of that system. In particular, the impulseExpand
Subspace identification of (AR)ARMAX, Box-Jenkins, and generalized model structures
Abstract An algorithm is proposed for the subspace identification of a generalized discrete linear time invariant model structure, composing of a deterministic and a stochastic subsystem that areExpand
Application of structured total least squares for system identification and model reduction
The following identification problem is considered: Minimize the /spl lscr//sub 2/ norm of the difference between a given time series and an approximating one under the constraint that theExpand
The Balanced Mode Decomposition Algorithm for Data-Driven LPV Low-Order Models of Aeroservoelastic Systems
TLDR
A novel approach to reduced-order modeling of high-dimensional systems with time-varying properties which combines the problem formulation of the Dynamic Mode Decomposition method with the concept of balanced realization to obtain an input-output low dimensional linear model which approximates the system across its operating range. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Subspace model identification Part 1. The output-error state-space model identification class of algorithms
TLDR
Two novel algorithms to realize a finite dimensional, linear time-invariant state-space model from input-output data are presented: an RQ factorization followed by a singular value decomposition and the solution of an overdetermined set of equations. Expand
DATA DRIVEN SIMULATION WITH APPLICATIONS TO SYSTEM IDENTIFICATION
Abstract We present an iterative algorithm for computation of linear time-invariant system responses directly from an exact finite input/output trajectory of that system. In particular, the impulseExpand
A subspace algorithm for balanced state space system identification
In an earlier paper by Moonen et at. (1989), an algorithm has been introduced for identifying multivariable linear systems directly from input-output data. This new algorithm falls in the class ofExpand
Principal component analysis in linear systems: Controllability, observability, and model reduction
Kalman's minimal realization theory involves geometric objects (controllable, unobservable subspaces) which are subject to structural instability. Specifically, arbitrarily small perturbations in aExpand
From time series to linear system - Part II. Exact modelling
TLDR
First a mathematical vocabulary for discussing exact modelling is developed, and it is shown how the results of Part I guarantee the existence of a most powerful (AR) model for an observed time series. Expand
From time series to linear system - Part III: Approximate modelling
TLDR
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. Expand
Minimal realization of discrete linear systems from input-output observations
A direct procedure is presented for obtaining a minimal realization of a multiple-input multiple-output linear time-invariant discrete system from observations of the input and output. Discussion isExpand
On the identification of linear time-invariant systems from input-output data
This paper presents a new method for computing the parameters which determine the differential equations governing a linear time-invariant system with multiple inputs and outputs. Unlike earlierExpand
State Maps for Linear Systems
Modeling of physical systems consists of writing the equations describing a phenomenon and yields as a result a set of differential-algebraic equations. As such, state-space models are not a naturalExpand
A note on persistency of excitation
We prove that if a component of the response signal of a controllable linear time-invariant system is persistently exciting of sufficiently high order, then the windows of the signal span the fullExpand
...
1
2
...