scispace - formally typeset
Search or ask a question
Topic

System identification

About: System identification is a research topic. Over the lifetime, 21291 publications have been published within this topic receiving 439142 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The implications of strong signal compression for the signal-to-noise ratio lead to the formulation of a two-step optimal experimental setup for system identification and parameter estimation of linear systems.
Abstract: An overview is given of existing analytical and numerical methods for the comparison of the peaks of discrete, finite sum of sines. A novel method that compresses the signals optimally or almost optimally is presented. The algorithm is extended to the simultaneous compression of the input and output signals of a linear system. The implications of strong signal compression for the signal-to-noise ratio lead to the formulation of a two-step optimal experimental setup for system identification and parameter estimation of linear systems. >

104 citations

Journal ArticleDOI
TL;DR: The authors show that fast QR methods and lattice methods in least squares adaptive filtering are duals and follow from identical geometric principles, and develop a fast least squares algorithm of minimal complexity that is a hybrid between a QR and a lattice algorithm.
Abstract: The authors show that fast QR methods and lattice methods in least squares adaptive filtering are duals and follow from identical geometric principles. Whereas the lattice methods compute the residuals of a projection operation via the forward and backward prediction errors, the QR methods compute instead the weights used in the projections. Within this framework, the parameter identification problem is solved using fast QR methods by showing that the reflection coefficients and tap parameters of a least squares lattice filter operating in the joint process mode are immediately available as internal variables in the fast QR algorithms. This parameter set can be readily exploited in system identification, signal analysis, and linear predictive coding, for example. The relations derived also lead to a fast least squares algorithm of minimal complexity that is a hybrid between a QR and a lattice algorithm. The algorithm combines the order recursive properties of the lattice approach with the robust numerical behavior of the QR approach. >

104 citations

Proceedings ArticleDOI
14 May 2016
TL;DR: In this paper, the authors exploit the key idea that nonlinear system identification is equivalent to linear identification of the so-called Koopman operator and obtain a novel linear identification technique by recasting the problem in the infinite-dimensional space of observables.
Abstract: We exploit the key idea that nonlinear system identification is equivalent to linear identification of the so-called Koopman operator. Instead of considering nonlinear system identification in the state space, we obtain a novel linear identification technique by recasting the problem in the infinite-dimensional space of observables. This technique can be described in two main steps. In the first step, similar to a component of the Extended Dynamic Mode Decomposition algorithm, the data are lifted to the infinite-dimensional space and used for linear identification of the Koopman operator. In the second step, the obtained Koopman operator is “projected back” to the finite-dimensional state space, and identified to the nonlinear vector field through a linear least squares problem. The proposed technique is efficient to recover (polynomial) vector fields of different classes of systems, including unstable, chaotic, and open systems. In addition, it is robust to noise, well-suited to model low sampling rate datasets, and able to infer network topology and dynamics.

104 citations

Journal ArticleDOI
TL;DR: A very efficient Integrated Forward Orthogonal Search (IFOS) algorithm, which is assisted by the squared correlation and mutual information, and which incorporates a Generalised Cross-Validation (GCV) criterion and hypothesis tests, is introduced to overcome limitations in model structure selection.
Abstract: Model structure selection plays a key role in non-linear system identification. The first step in non-linear system identification is to determine which model terms should be included in the model. Once significant model terms have been determined, a model selection criterion can then be applied to select a suitable model subset. The well known Orthogonal Least Squares (OLS) type algorithms are one of the most efficient and commonly used techniques for model structure selection. However, it has been observed that the OLS type algorithms may occasionally select incorrect model terms or yield a redundant model subset in the presence of particular noise structures or input signals. A very efficient Integrated Forward Orthogonal Search (IFOS) algorithm, which is assisted by the squared correlation and mutual information, and which incorporates a Generalised Cross-Validation (GCV) criterion and hypothesis tests, is introduced to overcome these limitations in model structure selection.

104 citations

Journal ArticleDOI
TL;DR: A modified GA strategy is proposed to improve the accuracy and computational time for parameter identification of multiple degree-of-freedom (DOF) structural systems.

104 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
93% related
Linear system
59.5K papers, 1.4M citations
92% related
Robustness (computer science)
94.7K papers, 1.6M citations
91% related
Control system
129K papers, 1.5M citations
91% related
Optimization problem
96.4K papers, 2.1M citations
88% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023177
2022361
2021646
2020813
2019804
2018862