Abstract
This chapter develops methods for computing the most powerful unfalsified model for the data in the model class of linear time-invariant systems. The first problem considered is a realization of an impulse response. This is a special system identification problem when the given data is an impulse response. The method presented, known as Kung’s method, is the basis for more general exact identification methods known as subspace methods. The second problem considered is computation of the impulse response from a general trajectory of the system. We derive an algorithm that is conceptually simple—it requires only a solution of a system of linear equations. The main idea of computing a special trajectory of the system from a given general one is used also in data-driven simulation and control problems (Chap. 6). The next topic is identification of stochastic systems. We show that the problem of ARMAX identification splits into three subproblems: (1) identification of the deterministic part, (2) identification of the AR-part, and (3) identification of the MA-part. Subproblems 1 and 2 are equivalent to deterministic identification problem. The last topic considered in the chapter is computation of the most powerful unfalsified model from a trajectory with missing values. This problem can be viewed as Hankel matrix completion or, equivalently, computation of the kernel of a Hankel matrix with missing values. Methods based on matrix completion using the nuclear norm heuristic and ideas from subspace identification are presented.
A given phenomenon can be described by many models. A well known example is the Ptolemaic and the Copernican models of the solar system. Both described the observed plant movements up to the accuracy of the instruments of the 15th century.
A reasonable scientific attitude to a model to be used is that it has so far not been falsified. That is to say that the model is not in apparent contradiction to measurements and observations.
\(\ldots \)
Another valid scientific attitude is that among all the (so far) unfalsified possible models we should use the simplest one. This statement is a variant of Occam’s razor. It obviously leaves room for subjective aesthetic and pragmatic interpretations of what “simplest” should mean. It should be stressed that all unfalsified models are legitimate, and that any discussion on which one of these is the “true” one is bound to be futile.
K. Lindgren
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alenany A, Shang H, Soliman M, Ziedan I (2010) Subspace identification with prior steady-state information. In: Proceedings of the international conference on computer engineering and systems, Cairo, Egypt
Alkire B, Vandenberghe L (2002) Convex optimization problems involving finite autocorrelation sequences. Math Program Ser A 93(3):331–359
Boyd S, Vandenberghe L (2001) Convex optimization. Cambridge University Press, Cambridge
Budin MA (1971) Minimal realization of discrete linear systems from input-output observations. IEEE Trans Autom Control 16(5):395–401
Chiuso A (2006) Asymptotic variance of closed-loop subspace identification methods. IEEE Trans Autom Control 51(8):1299–1314
Chou C, Verhaegen M (1997) Subspace algorithms for the identification of multivariate errors-in-variables models. Automatica 33(10):1857–1869
Fazel M (2002) Matrix rank minimization with applications. PhD thesis, Electrical Engineering Department, Stanford University
Fazel M, Pong TK, Sun D, Tseng P (2013) Hankel matrix rank minimization with applications in system identification and realization. SIAM J Matrix Anal Appl 34(3):946–977
Gill PE, Murray M, Wright MH (1999) Practical optimization. Academic Press, New York
Goethals I, Van Gestel T, Suykens J, Van Dooren P, De Moor B (2003) Identification of positive real models in subspace identification by using regularization. IEEE Trans Autom Control 48:1843–1847
Gopinath B (1969) On the identification of linear time-invariant systems from input-output data. Bell Syst Tech J 48(5):1101–1113
Grant M, Boyd S (2017) CVX: Matlab software for disciplined convex programming. http://stanford.edu/~boyd/cvx
Heij C (1989) Deterministic identification of dynamical systems. Lecture notes in control and information sciences, vol 127. Springer, Berlin
Liu Z, Vandenberghe L (2009) Interior-point method for nuclear norm approximation with application to system identification. SIAM J Matrix Anal Appl 31(3):1235–1256
Ljung L (1999) System identification: theory for the user. Prentice-Hall, Englewood Cliffs
Maciejowski J (1995) Guaranteed stability with subspace methods. Control Lett 26:153–156
Markovsky I, Mercère G (2017) Subspace identification with constraints on the impulse response. Int J Control 1728–1735
Markovsky I, Willems JC, De Moor B (2006a) The module structure of ARMAX systems. In: Proceedings of the 41st conference on decision and control, San Diego, USA, pp 811–816
Markovsky I, Willems JC, Van Huffel S, De Moor B (2006b) Exact and approximate modeling of linear systems: a behavioral approach. SIAM, Philadelphia
Moonen M, De Moor B, Vandenberghe L, Vandewalle J (1989) On- and off-line identification of linear state-space models. Int J Control 49:219–232
Noël JP, Kerschen G (2013) Frequency-domain subspace identification for nonlinear mechanical systems. Mech Syst Signal Process 40(2):701–717
Rapisarda P, Trentelman H (2011) Identification and data-driven model reduction of state-space representations of lossless and dissipative systems from noise-free data. Automatica 47(8):1721–1728
Schoukens J, Vandersteen G, Rolain Y, Pintelon R (2012) Frequency response function measurements using concatenated subrecords with arbitrary length. IEEE Trans Instrum Meas 61(10):2682–2688
Söderström T, Stoica P (1989) System identification. Prentice Hall, Englewood Cliffs
Stoica P, Moses R (2005) Spectral analysis of signals. Prentice Hall, Englewood Cliffs
Stoica P, McKelvey T, Mari J (2000) MA estimation in polynomial time. IEEE Trans Signal Process 48(7):1999–2012
Trnka P, Havlena V (2009) Subspace like identification incorporating prior information. Automatica 45:1086–1091
Usevich K, Comon P (2015) Quasi-Hankel low-rank matrix completion: a convex relaxation. arXiv:1505.07766
Van Overschee P, De Moor B (1996) Subspace identification for linear systems: theory, implementation, applications. Kluwer, Boston
Verhaegen M, Dewilde P (1992) Subspace model identification, part 1: the output-error state-space model identification class of algorithms. Int J Control 56:1187–1210
Viberg M (1995) Subspace-based methods for the identification of linear time-invariant systems. Automatica 31(12):1835–1851
Willems JC (1986a) From time series to linear system—Part I. Finite dimensional linear time invariant systems. Automatica 22(5):561–580
Willems JC (1986b) From time series to linear system—Part II. Exact modelling. Automatica 22(6):675–694
Willems JC (1987) From time series to linear system—Part III. Approximate modelling. Automatica 23(1):87–115
Willems JC, Rapisarda P, Markovsky I, De Moor B (2005) A note on persistency of excitation. Syst Control Lett 54(4):325–329
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Markovsky, I. (2019). Exact Modeling. In: Low-Rank Approximation. Communications and Control Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-89620-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-89620-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89619-9
Online ISBN: 978-3-319-89620-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)