Departement Elektrotechniek ESAT-SISTA/TR About the choice of State Space Basis in Combined. Deterministic-Stochastic Subspace Identication 1
|
|
- Joanna Daniel
- 6 years ago
- Views:
Transcription
1 Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR About the choice of State Space asis in Combined Deterministic-Stochastic Subspace Identication Peter Van Overschee and art De Moor 2 December 994 Submitted for Publication to Automatica This report is available by anonymous ftp from gate.esat.kuleuven.ac.be in the directory /pub/sista/vanoverschee/reports/bal pap.ps.z. This paper presents research results of the elgian Programme on Interuniversity Poles of Attraction (IUAPno. 7 and 50), initiated by the elgian State, Prime Minister's Oce for Science, Technology and Culture. The scientic responsibility rests with its authors. 2 ESAT - Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, 300 Leuven (Heverlee), elgium, tel 32/6/32709, fax 32/6/32986, peter.vanoverschee@esat.kuleuven.ac.be and bart.demoor@esat.kuleuven.ac.be. Peter Van Overschee is a research assistant and art De Moor a senior research associate of the elgian National Fund for Scientic Research.
2 abstract This paper describes how the state space basis of models identied with subspace identication algorithms can be determined. It is shown that this basis is determined by the input spectrum and by user dened input and output weightings. Through the connections between subspace identication and frequency weighted balancing, the state space basis of the subspace identied models is shown to coincide with a frequency weighted balanced basis. Introduction The identication problem considered in the combined deterministic-stochastic subspace identication papers [4, 8, 0, ] is the following : let u k 2 R m ; y k 2 R l be the observed input and output generated by the unknown system : x k+ Ax k + u k + w k ; y k Cx k + Du k + v k ; () with E[ w k v k w T l v T l ] Q S T S R kl 0 ; (2) and A; Q 2 R nn ; 2 R nm ; C 2 R ln ; D 2 R lm ; S 2 R nl and R 2 R ll. v k 2 R l and w k 2 R n are unobserved, zero mean, white noise vector sequences. fa; Cg and fa; [ Q 2 ]g are assumed to be observable respectively controllable. The main identication problem is then stated as : Given N input-output measurements generated by the system ()-(2), nd A; ; C; D; Q; R; S up to within a similarity transformation. Several solutions for this problem have been described in the literature [4, 8, 0, ]. Although the solutions look very dierent at rst sight, it was shown in [9] that these algorithms use the same basic subspace, but weighted in a dierent way. In this paper the eect of these weights will be further explored. It will be shown that the state space basis of the identied model corresponds to an inputoutput frequency weighted balanced basis as described by Enns [3]. The weights in the frequency domain are a function of the input (u k ) applied to the system and of the weighting matrices W and W 2 introduced in [9]. The main Theorem introduces specic choices for these weighting matrices, such that the system is identied in a predened state space basis. As a special case, we will investigate the state space basis of the N4SID algorithm [8]. A nice side result is the lower order identication problem. Since the basis in which the state space matrices are identied is well dened and is frequency weighted balanced, it is very easy to truncate the model after identication to a lower order model. This corresponds exactly to the technique of frequency weighted model reduction of Enns [3]. This paper is organized as follows : In Section 2 we introduce some notation and background. Section 3 shortly introduces the concepts of frequency weighted balancing. In Section 4 the E denotes the expected value operator and kl the Kronecker delta.
3 main Theorem is presented. Section 5 addresses the problem of reduced order identication. Finally Section 6 contains the conclusions. 2 Notation and ackground In this Section we introduce the notation used throughout the paper : input and output block Hankel matrices, system related matrices and weighting matrices. We also shortly revise some results on subspace identication. Throughout the paper, we will consider the model ()-(2) in its forward innovations form as [6] : x k+ Ax k + u k + Ee k ; y k Cx k + Du k + F e k ; E[e k e T l ] I kl ; (3) with E 2 R nl, F 2 R ll, and the innovations e k 2 R l uncorrelated with u k. The transformation from the system ()-(2) to this innovations model can be done through the solution of a Riccati equation [6]. The steady state Kalman gain is given by K EF? 2 R nl. Subspace identication algorithms make extensive use of input and output block Hankel matrices. We dene : U p u 0 u : : : u j? u u 2 : : : u j : : : : : : : : : : : : u i? u i : : : u i+j?2 C A, U f u i u i+ : : : u i+j? u i+ u i+2 : : : u i+j : : : : : : : : : : : : u 2i? u 2i : : : u 2i+j?2 Somewhat loosely we denote U p as the past inputs and U f as the future inputs. Through a similar denition, Y p and Y f are dened as the past respectively the future outputs and E p and E f as the past respectively the future innovations. We assume that j throughout the paper and that all sequences are ergodic. The time averaging operator E j is dened as : E j [] j j [] : The covariance matrix of the past inputs R p will play an important role in several derivations : R p E j [U p Up T ] L p :L T p, where L p is a lower triangular square root of R p obtained e.g. via a Cholesky decomposition of R p. The extended (i > n) observability matrix? i is dened as :? i C T (CA) T : : : (CA i? ) T T : The extended (i > n) reversed deterministic d i and stochastic s i controllability matrices are dened as : d i A i? : : : A ; s i A i? E : : : AE E : C A : 2
4 Furthermore we dene the block Toeplitz matrices containing the Markov parameters of the deterministic and the stochastic system as : H d i D 0 : : : 0 C D : : : 0 : : : : : : : : : : : : CA i?2 CA i?3 : : : D C A ; H s i F 0 : : : 0 CE F : : : 0 : : : : : : : : : : : : CA i?2 E CA i?3 E : : : F The (non-steady state) Kalman lter state sequence e Xi is dened as in [8] : ex i exi ex i+ ex i+2 : : : ex i+j? Each of its columns is the output of a non-steady state Kalman lter (see [8, 9] for more details). The Z-transforms (initial state equal to zero) of u k and y k are denoted by respectively U(z) and Y (z), while the spectral factor of e k is denoted by E(z). From (3) we then nd : Y (z) G(z)U(z)+H(z)E(z) with G(z) D+C(zI?A)? and H(z) F +C(zI?A)? E. The spectral factor of u k is denoted by S u (z) : U(z)U T (z? ) S u (z)su T (z? ) with all poles of S u (z) and S? (z) inside the unit circle. We dene the input and output weighting matrix functions as : u W u (z) D u + C u (zi? A u )? u ; W y (z) D y + C y (zi? A y )? y : From the Markov parameters of these functions, the weighting matrices Wi u formed : W u i D u 0 : : : 0 C u u D u : : : 0 : : : : : : : : : : : : C u A i?2 u u C u A i?3 u u : : : D u C A ; W y i : and W y i C D y 0 : : : 0 C y y D y : : : 0 A : can be : : : : : : : : : : : : C y A i?2 y y C y A i?3 y y : : : D y A denotes the operator that projects the row space of a matrix onto the row space of A (which is assumed to be of full row rank) : A A T (AA T )? A. The projection of the row space of onto the row space of A is dened as : A : A A T (AA T )? A. The orthogonal complement of the row space of A is denoted by A?. The unifying Theorem of [9] describes how the extended observability matrix? i and the states ex i can be recovered directly from the input-output data u k and y k. The Theorem introduces two weighting matrices W 2 R lili and W 2 2 R jj that will play an important role in this paper. The main results of the Theorem [9] are that the system order n and the matrices? i and e Xi can be determined from an innite number of input-output data through the non-zero singular values and the left and right singular vectors of the matrix : " W :E j [ (Y f U? U p f ):( U? f ) T U ] E p j [ ( U? U p f ):( U? f ) T ] Y p Y p Y p #? Up :W 2 Y p C A : 3
5 ek H(z) yk W y (z) W u (z) uk G(z) Figure : Cascade system used for the interpretation of frequency weighted balancing. The weights W u (z) and W y (z) are user dened. Note that the noise input (the input to H(z)) has no extra weight, since from an input-output view, this weight is indistinguishable from H(z). which has a singular value decomposition given by :? i and e Xi then follow from : U :S :V T : (4) W? i U S 2 ; e Xi W 2 S 2 V T : (5) We refer to [9] for more details. It is known from linear system theory that? i and Xi e are only determined up to within a non-singular similarity transformation T 2 R nn :? i? i T and e Xi T? e X i. This implies that the following question makes sense : In which state space basis are? i and e Xi determined when a subspace method is used to estimate them? In what follows, we will show that this basis is a function of the weights W and W 2, and that by a proper choice of these weights, the basis can be altered in a user controlled manner. Furthermore, it will be shown that the singular values S (4) used to determine the system order have a clear interpretation from a linear system theoretical point of view. 3 Frequency Weighted alancing In this Section we recapitulate the results of Enns [3] for frequency weighted balancing. We also show how the frequency weighted Gramians introduced by Enns can be calculated from the extended observability and controllability matrices and from the weighting matrices. Well known in system theory is the notion of \balanced realization" [7]. Enns [3] has developed a frequency weighted extension of this result. The idea is that input and output frequency weights can be introduced as to emphasize certain frequency bands in the balancing procedure (Figure ). Instead of using the regular controllability and observability Gramians, Enns uses frequency weighted Gramians : 4
6 Denition Frequency Weighted Gramians The solution P of the Lyapunov equation : A C u 0 A u P P2 T P 2 P 22 T A C u + D u E 0 A u u 0 D u E u 0 T P P2 T ; P 2 P 22 is called the W u (z) weighted controllability Gramian and is denoted by P [W u (z)] P. The solution Q of the Lyapunov equation : T A 0 y C A y Q Q 2 Q T 2 Q 22 A 0 T D y C C y y C A y D y C C y (6) Q Q 2 ; Q T 2 Q 22 is called the W y (z) weighted observability Gramian and is denoted by Q[W y (z)] Q. Just as for the classical balancing procedure, a similarity transformation can be found that makes both Gramians diagonal and equal to each other. In that case the system is said to be \Frequency Weighted alanced". Denition 2 Frequency Weighted alancing The system (3) is called [W u (z); W y (z)] frequency weighted balanced when P [W u (z)] Q[W y (z)] where diagonal[ ; 2 ; : : :; n ]. The diagonal elements k are called the frequency weighted Hankel singular values, and will be denoted by k [W u (z); W y (z)]. (7) Even though (6) and (7) are easily solvable for P [W u (z)] and Q[W y (z)], we present a dierent way to compute these weighted Gramians. These expressions will enable us to make the connection between subspace identication and frequency weighted balancing. Lemma With A asymptotically stable, we have : P [W u (z)] [ d i i :W i u:(w i u)t :( d i )T + s i :(s i )T ] ; (8) Q[W y (z)] [? T i i :(W y i )T :(W y i ):? i] : (9) A proof can be found in appendix A. 4 Subspace Identication and Frequency Weighted alancing In this Section we consider the connection between frequency weighted balancing and subspace identication. We show how the weights W and W 2 inuence the Gramians P [W u (z)] and Q[W y (z)] corresponding to the state space basis of? i and e Xi. 5
7 4. Main Result Theorem - Main Theorem With A asymptotically stable and i 2, we have with : W W y i ; W 2 U T p R? p W u i L? p U p + U? p ; (0) that the W u (z) weighted controllability Gramian and W y (z) weighted observability Gramian of the state space basis corresponding to? i and e Xi are given by (with S from (4)) : P [W u (z)] S Q[W y (z)] : () A proof of the Theorem can be found in Appendix. The Theorem implies that the state space basis of? i and Xi e for the choice of W and W 2 given by (0) is the [W u (z); W y (z)] frequency weighted balanced basis. It also implies that the singular values S are the [W u (z); W y (z)] frequency weighted Hankel singular values. 4.2 Special cases of the rst main Theorem Even though the weighting matrices Wi u and W y i can be chosen arbitrarily, there are some special cases that lead to algorithms published in the literature. N4SID N4SID stands for Numerical algorithms for Subspace State Space System Identication [8, ]. With the results of [9], it is easy to show that N4SID delivers the following choice of weighting matrices in Theorem : Wi u L p and W y i I. It is easy to verify that (for i ) the lower triangular matrix L p corresponds to the Toeplitz matrix generated by the Markov parameters of the spectral factor S u (z) of u k. This implies that (for N4SID) the input weight W u (z) in the frequency weighted balancing procedure corresponds to the spectral factor S u (z). alanced Realization With the weighting matrices W u i I and W y i I we nd : P [I(z)] S Q[I(z)]. Now it is easy to verify that P [I(z)] and Q[I(z)] are equal to the unweighted controllability respectively observability Gramian. This implies that the basis of? i and e Xi is the classical balanced basis as described in [7]. A similar result for pure deterministic systems was obtained in [5]. 5 Consequences for Reduced order Identication In this section we apply the results of the main Theorem to the identication of lower order systems. The connections with frequency weighted model reduction are exploited. As has been proven in this paper, subspace identication of a model of order n (the exact state space order) leads to a state space system that is [W u (z); W y (z)] frequency weighted 2 Note that rst j through the operator E j, after which i. 6
8 balanced. This nth order model can then be easily reduced to a model of lower order r by truncating it as follows : A r n? r n? r A 2 A 22 r A A 2 ; m r n? r 2 r n? r ; C l C C 2 ; E l r E : n? r E 2 The reduced order model is described by the matrices : A ; ; C ; D; E ; F. The reduced transfer functions are denoted by : b G(z) D + C (zi? A )? and b H(z) F + C (zi? A )? E. Enns [3] now suggested the following conjecture in his Thesis : when truncating a [W u (z); W y (z)] frequency balanced system, the innity norm of the dierence between the original and the reduced system can be upperbounded by the neglected weighted Hankel singular values. In the framework of this paper (see also Figure ), this conjecture becomes : k W y (z) [ G(z)? G(z) b ] Wu (z) j W y (z) [ H(z)? H(z) b ] k nx 2 kr+ k [W u (z); W y (z)]( + ) ; > 0 : (2) The conjecture consists of the fact that is \small". Let us pounder a bit about this conjecture. We have tried to nd a simple expression for, but (just as Enns) did not succeed (as didn't any one else as far as we know, even though the problem has been open since 984). Even though the result is ambiguous ( has never been proven to be bounded, let alone to be small), the \heuristic" model reduction technique seems to work very well in practice [2, 2]. It turns out that, even though not a real upper bound, two times the sum of the neglected singular values ( 0) gives a good indication about the size of the error. More importantly (2) states that the t of the truncated lower order model will be good where W u (z) and W y (z) are large. This implies that by a proper choice of W u (z) and W y (z) the distribution of the error in the frequency domain can be shaped. We nd for the special cases : N4SID k [ G(z)? b G(z) ] Su (z) j [ H(z)? b H(z) ] k 2 nx kr+ k ( + ) : We can conclude that the error of the model will be small where the frequency content of the input is large. This is a very intuitive result : A lot of input energy in a certain frequency band leads to an accurate model in that band. Also note that the error on the noise model can not be shaped by the user. alanced basis k [ G(z)? b G(z) ] j [ H(z)? b H(z) ] k 2 nx kr+ Note that for this case setting 0 is justied, since for (unweighted) balanced model reduction two times the sum of the Hankel singular values is actually a proven upper bound for the truncation error (see for instance []). 7 k :
9 6 Conclusions In this paper we have shown that the state space basis of the subspace identied models corresponds to a frequency weighted balanced basis. The frequency weights are determined by the input spectrum and by user dened input and output weighting functions. References [] Al-Saggaf U.M., Franklin G.F. (987). An error bound for a discrete reduced order model of a linear multivariable system. IEEE Trans. on Aut. Control, Vol. 32, pp [2] Anderson.D.O., Moore J.. (989). Optimal Control - Linear Quadratic Methods. Prentice Hall. [3] Enns D. (984). Model reduction for control system design. Ph.D.. dissertation, Dep. Aeronaut. Astronaut., Stanford University, Stanford CA. [4] Larimore W.E. (990). Canonical Variate Analysis in Identication, Filtering, and Adaptive Control. Proceedings of the 29th Conference on Decision and Control, Hawaii, pp [5] Moonen M., Ramos J. (99). A subspace algorithm for balanced state space system identication. IEEE Trans. Automatic Control, Vol. 38, pp [6] Pal D. (982). alanced Stochastic Realization and Model Reduction. Master's thesis, Washington State University, Electrical Engineering. [7] Moore.C. (98). Principal component analysis in linear systems: controllability, observability and model reduction. IEEE Trans. on Aut. Control, Vol. 26, pp [8] Van Overschee P., De Moor. (994). N4SID : Subspace Algorithms for the Identication of Combined deterministic-stochastic Systems. Automatica (Special Issue on Statistical Signal Processing and Control), Vol. 30, No., pp , 994. [9] Van Overschee P., De Moor. (994). A Unifying Theorem for three Subspace System Identication Algorithms. ESAT/SISTA report , Kath. Universiteit Leuven, Dept. E.E., elgium. Accepted for publication in Automatica. [0] Verhaegen M. (994). Identication of the deterministic part of MIMO state space models given in innovations form from input-output data. Automatica (Special Issue on Statistical Signal Processing and Control), Vol. 30, No., pp [] Viberg M., Ottersten., Wahlberg., Ljung L. (993). Performance of Subspace ased State Space System Identication Methods. Proc. of the 2th IFAC World Congress, Sydney, Australia, 8-23 July, Vol. 7, pp
10 [2] Wortelboer P.M.R., osgra O.H. (992). Generalized frequency weighted balanced reduction. Selected Topics in Identication, Modeling and Control, Delft University Press, Vol. 5, pp A Proof of Lemma We rst prove equation (8). controllability Lyapunov equation (6) : Hereto we consider the dierent sub-blocks of the weighted P AP A T + EE T + AP T 2C T u T + C u P 2 A T + [C u P 22 C T u + D u D T u ] T ; (3) P 2 A u P 2 A T + [A u P 22 C T u + u D T u ] T ; (4) P 22 [A u P 22 A T u + u T u ] : (5) We rst prove that with u i A i? u : : : A u u u we have : Proof of (6) : u i :( u i ) T P 22 [ u i i :(u i )T ] ; (6) P 2 [ u i :(Wi u ) T :( d i ) T ] : i (7) A u : u i? u ( u i? )T A T u T u A u [ u i?:( u i?) T ]A T u + u : T u : (8) For stable A u ( i [A i? u ] 0) we also have that : i [u i :( u i ) T ] [ u i i?:( u i?) T + A i? u 0 u ) {z T } 0 u T u (A i? ] [ u i i?:( u i?) T ] : (9) Taking the it for i on both sides of (8), we nd with (9) that i [( u i (u i )T ] is the solution of the same Lyapunov equation (5) as P 22 and thus prove (6). Proof of (7) : u i :(W u i )T :( d i )T A u u i? u (W u i? )T ( u i? )T C T u 0 D T u ( d i? )T A T T A u :[ u i? :(W u i? )T :( d i? )T ]:A T + [A u ( u i? :(u i? )T )C T u + ud T u ]T (20) For stable A u and A we have : i [ u i :(W u i )T :( d i )T ] i [ u i? :(W u i? )T :( d i? )T ]. Taking the it for i on both sides of (20), we thus nd with (6) that : i [u i :(W i u)t :( d i )T ] A u : [ u i i :(W i u)t :( d i )T ]:A T + [A u P 22 Cu T + udu T ]T ; which proves that i [ u i :(W u i )T :( d i )T ] is the solution of the same equation as P 2 (4) and thus proves (7). 9
11 Finally, we prove (8) : i [d i :W u i :(W u i )T :( d i )T + s i :(s i )T ] i [ + A d i? A s i? E Wi? u 0 C u u i? D u ( s i? )T A T E T (W u i? )T ( u i? )T C T u 0 D T u A: i [d i? :W u i? :(W u i? )T :( d i? )T + s i? :(s i? )T ]A T + EE T ] +A: i [d i? :W u i? :(u i? )T ]C T u T + C u : i [u i? :(W u i? )T :( d i? )T ]A T +[C u : i [u i? :(u i? )T ]C T + D u ud T u ]T A: i [d i? :W i? u :(W i? u )T :( d i? )T + s i? :(s i? )T ]A T + EE T ( d i? )T A T T +AP T 2 C T u T + C u P 2 A T + [C u P 22 C T u + D ud T u ]T : (2) Through a similar reasoning as before, it is easy to prove that with A and A u stable : i [d i :W u i :(W u i ) T :( d i ) T + s i :( s i) T ] i [ d i?:w u i?:(w u i?) T :( d i?) T + s i?:( s i?) T ] ; which proves with (2) that i [ d i :W u i :(W u i )T :( d i )T + s i :(s i )T ] is the solution of the same equation as P (3) and thus proves (8). The proof of (9) is analogous to the proof of (8). Proof of Theorem From [8] we have : ex i [A i? Q i? i ]S(R? ) jmi + d i? Q ih d i Q i U p Y p : (22) For the meaning of the symbols we refer to [8]. The only properties we use here are (from [8], for stable A) : i [Ai? Q i? i ] 0 ; [Q i? i ] 0 ; [Q i H s i i i :(Hi s ) T Q T i ] [ s i i: s i ] : (23) Using Y p? i X p + H d i U p + H s i E p, where X p are the past states of the forward innovation model (3) [8], we can rewrite (22) as : ex i M i + d i U p + Q i H s i E p ; (24) with : M i [A i? Q i? i ]S(R? ) jmi U p + Q i? i X p : Since the input u k and the noise e k are uncorrelated, we also know that [8] : E j [U p :E T p ] 0 ; E j [M i :E T p ] 0 ; E j [E p :W 2 :W T 2 :E T p ] E j [E p :E T p ] I : (25) 0
12 Formula (24) combined with the expression for W 2 in (0) leads to : E j[ e Xi:W2:W T 2 : e X T i ] E j[(m i + d i U p + Q ih s i E p):w2:w T 2 :(M i + d i U p + Q ih s i E p) T ] d i E j[u p:w2:w T 2 :U T p ]( d i ) T + Q ih s i E j[e p:w2:w T 2 :E T p ](H s i ) T Q T i +E j[(m i + d i U p)e T p ] 0 (25) +E j[e p(m i + d i U p) T ] 0 (25) +E j[m i:w2:w T 2 :M T i + M i:w2:w T 2 :U T p ( d i ) T + d i U p:w2:w T 2 :M T i ] Ci Rp Rp d i E j[u pu T p ] R? p W u i L? p E j[u pu T p ] I (25) L?T +Q ih s i E j[e p:w2:w2 T :E T p ](H s i ) T Q T i + C i Rp p (W u i ) T R? p E j[u pu T p ]( d i ) T d i W u i (W u i ) T ( d i ) T + Q ih s i (H s i ) T Q T i + C i : (26) Using (23) it is easy to show that i [C i ] 0. Taking the it for i on both sides of (26) thus gives (use (23)) : i h Ej [ e Xi :W 2 :W T 2 : e X T i ]i On the other hand, we know from (5) that : i h Ej [ e Xi :W 2 :W T 2 : e X T i ]i Finally, from (27) and (28) we nd : i [ d i W u i (W u i ) T ( d i ) T + s i ( s i ) T ] : (27) [S 2 i V T V S 2 ] S : (28) i [d i :W u i :(W u i )T :( d i )T + s i :(s i )T ] S : From Lemma we know that the left part of this expression is equal to P [W u (z)]. This leads to P [W u (z)] S which is exactly the rst part of (). From (5) we know that? T i W T W? i S 2 U T U S 2 S. Combining this with Lemma (9) and with W W y i (0), we nd : Q[W y (z)] [? T i :(W y i i )T :W y i :? i] [? T i W T W? i ] S ; i which is the second part of ().
Experimental evidence showing that stochastic subspace identication methods may fail 1
Systems & Control Letters 34 (1998) 303 312 Experimental evidence showing that stochastic subspace identication methods may fail 1 Anders Dahlen, Anders Lindquist, Jorge Mari Division of Optimization and
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationRECURSIVE SUBSPACE IDENTIFICATION IN THE LEAST SQUARES FRAMEWORK
RECURSIVE SUBSPACE IDENTIFICATION IN THE LEAST SQUARES FRAMEWORK TRNKA PAVEL AND HAVLENA VLADIMÍR Dept of Control Engineering, Czech Technical University, Technická 2, 166 27 Praha, Czech Republic mail:
More informationdeveloped by [3], [] and [7] (See Appendix 4A in [5] for an account) The basic results are as follows (see Lemmas 4A and 4A2 in [5] and their proofs):
A Least Squares Interpretation of Sub-Space Methods for System Identication Lennart Ljung and Tomas McKelvey Dept of Electrical Engineering, Linkoping University S-58 83 Linkoping, Sweden, Email: ljung@isyliuse,
More informationA New Subspace Identification Method for Open and Closed Loop Data
A New Subspace Identification Method for Open and Closed Loop Data Magnus Jansson July 2005 IR S3 SB 0524 IFAC World Congress 2005 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems
More informationMultirate MVC Design and Control Performance Assessment: a Data Driven Subspace Approach*
Multirate MVC Design and Control Performance Assessment: a Data Driven Subspace Approach* Xiaorui Wang Department of Electrical and Computer Engineering University of Alberta Edmonton, AB, Canada T6G 2V4
More informationSubspace Identification With Guaranteed Stability Using Constrained Optimization
IEEE TANSACTIONS ON AUTOMATIC CONTOL, VOL. 48, NO. 7, JULY 2003 259 Subspace Identification With Guaranteed Stability Using Constrained Optimization Seth L. Lacy and Dennis S. Bernstein Abstract In system
More informationThe characteristic equation and minimal state space realization of SISO systems in the max algebra
KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 93-57a The characteristic equation and minimal state space realization of SISO systems in the max algebra B De Schutter and B
More informationThe model reduction algorithm proposed is based on an iterative two-step LMI scheme. The convergence of the algorithm is not analyzed but examples sho
Model Reduction from an H 1 /LMI perspective A. Helmersson Department of Electrical Engineering Linkoping University S-581 8 Linkoping, Sweden tel: +6 1 816 fax: +6 1 86 email: andersh@isy.liu.se September
More informationSVD-based optimal ltering with applications to noise reduction in speech signals Simon Doclo ESAT - SISTA, Katholieke Universiteit Leuven Kardinaal Me
Departement Elektrotechniek ESAT-SISTA/TR 999- SVD-based Optimal Filtering with Applications to Noise Reduction in Speech Signals Simon Doclo, Marc Moonen April, 999 Internal report This report is available
More informationModel reduction for linear systems by balancing
Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,
More informationDepartement Elektrotechniek ESAT-SISTA/TR 98- Stochastic System Identication for ATM Network Trac Models: a Time Domain Approach Katrien De Cock and Bart De Moor April 998 Accepted for publication in roceedings
More informationx 104
Departement Elektrotechniek ESAT-SISTA/TR 98-3 Identication of the circulant modulated Poisson process: a time domain approach Katrien De Cock, Tony Van Gestel and Bart De Moor 2 April 998 Submitted for
More informationAdaptive Channel Modeling for MIMO Wireless Communications
Adaptive Channel Modeling for MIMO Wireless Communications Chengjin Zhang Department of Electrical and Computer Engineering University of California, San Diego San Diego, CA 99- Email: zhangc@ucsdedu Robert
More informationOptimal trac light control for a single intersection Bart De Schutter and Bart De Moor y ESAT-SISTA, KU Leuven, Kardinaal Mercierlaan 94, B-3 Leuven (
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 97- Optimal trac light control for a single intersection Bart De Schutter and Bart De Moor Proceedings of the 997 International
More informationThe Linear Dynamic Complementarity Problem is a special case of the Extended Linear Complementarity Problem B. De Schutter 1 B. De Moor ESAT-SISTA, K.
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 9-1 The Linear Dynamic Complementarity Problem is a special case of the Extended Linear Complementarity Problem 1 Bart De Schutter
More informationMaster-Slave Synchronization using. Dynamic Output Feedback. Kardinaal Mercierlaan 94, B-3001 Leuven (Heverlee), Belgium
Master-Slave Synchronization using Dynamic Output Feedback J.A.K. Suykens 1, P.F. Curran and L.O. Chua 1 Katholieke Universiteit Leuven, Dept. of Electr. Eng., ESAT-SISTA Kardinaal Mercierlaan 94, B-1
More informationDepartement Elektrotechniek ESAT-SISTA/TR Minimal state space realization of SISO systems in the max algebra 1.
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 9- inimal state space realization of SISO systems in the max algebra 1 Bart De Schutter and Bart De oor October 199 A short version
More informationSystem Identification by Nuclear Norm Minimization
Dept. of Information Engineering University of Pisa (Italy) System Identification by Nuclear Norm Minimization eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain Systems
More informationState will have dimension 5. One possible choice is given by y and its derivatives up to y (4)
A Exercise State will have dimension 5. One possible choice is given by y and its derivatives up to y (4 x T (t [ y(t y ( (t y (2 (t y (3 (t y (4 (t ] T With this choice we obtain A B C [ ] D 2 3 4 To
More informationDynamic Data Factorization
Dynamic Data Factorization Stefano Soatto Alessro Chiuso Department of Computer Science, UCLA, Los Angeles - CA 90095 Department of Electrical Engineering, Washington University, StLouis - MO 63130 Dipartimento
More informationModel reduction of interconnected systems
Model reduction of interconnected systems A Vandendorpe and P Van Dooren 1 Introduction Large scale linear systems are often composed of subsystems that interconnect to each other Instead of reducing the
More informationIn: Proc. BENELEARN-98, 8th Belgian-Dutch Conference on Machine Learning, pp 9-46, 998 Linear Quadratic Regulation using Reinforcement Learning Stephan ten Hagen? and Ben Krose Department of Mathematics,
More informationSubspace Identification
Chapter 10 Subspace Identification Given observations of m 1 input signals, and p 1 signals resulting from those when fed into a dynamical system under study, can we estimate the internal dynamics regulating
More informationUnbiased minimum variance estimation for systems with unknown exogenous inputs
Unbiased minimum variance estimation for systems with unknown exogenous inputs Mohamed Darouach, Michel Zasadzinski To cite this version: Mohamed Darouach, Michel Zasadzinski. Unbiased minimum variance
More informationOn Consistency of Closed-loop Subspace Identifictaion with Innovation Estimation
Technical report from Automatic Control at Linköpings universitet On Consistency of Closed-loop Subspace Identictaion with Innovation Estimation Weilu Lin, S Joe Qin, Lennart Ljung Division of Automatic
More informationDESIGNING A KALMAN FILTER WHEN NO NOISE COVARIANCE INFORMATION IS AVAILABLE. Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof
DESIGNING A KALMAN FILTER WHEN NO NOISE COVARIANCE INFORMATION IS AVAILABLE Robert Bos,1 Xavier Bombois Paul M. J. Van den Hof Delft Center for Systems and Control, Delft University of Technology, Mekelweg
More informationOn Identification of Cascade Systems 1
On Identification of Cascade Systems 1 Bo Wahlberg Håkan Hjalmarsson Jonas Mårtensson Automatic Control and ACCESS, School of Electrical Engineering, KTH, SE-100 44 Stockholm, Sweden. (bo.wahlberg@ee.kth.se
More informationWeighted balanced realization and model reduction for nonlinear systems
Weighted balanced realization and model reduction for nonlinear systems Daisuke Tsubakino and Kenji Fujimoto Abstract In this paper a weighted balanced realization and model reduction for nonlinear systems
More informationCANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM
CANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM Ralf L.M. Peeters Bernard Hanzon Martine Olivi Dept. Mathematics, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht,
More informationSUBSPACE IDENTIFICATION METHOD FOR COMBINED DETERMINISTIC-STOCHASTIC BILINEAR SYSTEMS. Huixin Chen and Jan Maciejowski 1
SUBSPACE IDENTIFICATION METHOD FOR COMBINED DETERMINISTIC-STOCHASTIC BILINEAR SYSTEMS Huixin Chen and Jan Maciejowski 1 Department of Engineering University of Cambridge Cambridge CB2 1PZ, U.K. Abstract:
More informationAdaptive linear quadratic control using policy. iteration. Steven J. Bradtke. University of Massachusetts.
Adaptive linear quadratic control using policy iteration Steven J. Bradtke Computer Science Department University of Massachusetts Amherst, MA 01003 bradtke@cs.umass.edu B. Erik Ydstie Department of Chemical
More informationIdentification of modal parameters from ambient vibration data using eigensystem realization algorithm with correlation technique
Journal of Mechanical Science and Technology 4 (1) (010) 377~38 www.springerlink.com/content/1738-494x DOI 107/s106-010-1005-0 Identification of modal parameters from ambient vibration data using eigensystem
More informationThe QR decomposition and the singular value decomposition in the symmetrized max-plus algebra
K.U.Leuven Department of Electrical Engineering (ESAT) SISTA Technical report 96-70 The QR decomposition and the singular value decomposition in the symmetrized max-plus algebra B. De Schutter and B. De
More informationSubspace Identification Methods
Czech Technical University in Prague Faculty of Electrical Engineering Department of Control Engineering Subspace Identification Methods Technical Report Ing. Pavel Trnka Supervisor: Prof. Ing. Vladimír
More informationOn Spectral Factorization and Riccati Equations for Time-Varying Systems in Discrete Time
On Spectral Factorization and Riccati Equations for Time-Varying Systems in Discrete Time Alle-Jan van der Veen and Michel Verhaegen Delft University of Technology Department of Electrical Engineering
More informationState space transformations and state space realization in the max algebra
K.U.Leuven Department of Electrical Engineering (ESAT) SISTA Technical report 95-10 State space transformations and state space realization in the max algebra B. De Schutter and B. De Moor If you want
More informationShannon meets Wiener II: On MMSE estimation in successive decoding schemes
Shannon meets Wiener II: On MMSE estimation in successive decoding schemes G. David Forney, Jr. MIT Cambridge, MA 0239 USA forneyd@comcast.net Abstract We continue to discuss why MMSE estimation arises
More informationClosed and Open Loop Subspace System Identification of the Kalman Filter
Modeling, Identification and Control, Vol 30, No 2, 2009, pp 71 86, ISSN 1890 1328 Closed and Open Loop Subspace System Identification of the Kalman Filter David Di Ruscio Telemark University College,
More informationMatrix factorization and minimal state space realization in the max-plus algebra
KULeuven Department of Electrical Engineering (ESAT) SISTA Technical report 96-69 Matrix factorization and minimal state space realization in the max-plus algebra B De Schutter and B De Moor If you want
More informationOrthogonal projection based subspace identification against colored noise
Control Theory Tech, Vol 15, No 1, pp 69 77, February 2017 Control Theory and Technology http://linkspringercom/journal/11768 Orthogonal projection based subspace identification against colored noise Jie
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On Markov Chains with Sluggish Transients. G. W. Stewart y.
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{94{77 TR{3306 On Markov Chains with Sluggish Transients G. W. Stewart y June, 994 ABSTRACT
More informationOptimal Sensor and Actuator Location for Descriptor Systems using Generalized Gramians and Balanced Realizations
Optimal Sensor and Actuator Location for Descriptor Systems using Generalized Gramians and Balanced Realizations B. MARX D. KOENIG D. GEORGES Laboratoire d Automatique de Grenoble (UMR CNRS-INPG-UJF B.P.
More informationA TOUR OF LINEAR ALGEBRA FOR JDEP 384H
A TOUR OF LINEAR ALGEBRA FOR JDEP 384H Contents Solving Systems 1 Matrix Arithmetic 3 The Basic Rules of Matrix Arithmetic 4 Norms and Dot Products 5 Norms 5 Dot Products 6 Linear Programming 7 Eigenvectors
More informationThe iterative convex minorant algorithm for nonparametric estimation
The iterative convex minorant algorithm for nonparametric estimation Report 95-05 Geurt Jongbloed Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wiskunde en Informatica
More informationHANKEL-NORM BASED INTERACTION MEASURE FOR INPUT-OUTPUT PAIRING
Copyright 2002 IFAC 15th Triennial World Congress, Barcelona, Spain HANKEL-NORM BASED INTERACTION MEASURE FOR INPUT-OUTPUT PAIRING Björn Wittenmark Department of Automatic Control Lund Institute of Technology
More informationOn max-algebraic models for transportation networks
K.U.Leuven Department of Electrical Engineering (ESAT) SISTA Technical report 98-00 On max-algebraic models for transportation networks R. de Vries, B. De Schutter, and B. De Moor If you want to cite this
More informationDepartement Elektrotechniek ESAT-SISTA/TR Dynamical System Prediction: a Lie algebraic approach for a novel. neural architecture 1
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 1995-47 Dynamical System Prediction: a Lie algebraic approach for a novel neural architecture 1 Yves Moreau and Joos Vandewalle
More informationEmbedding Recurrent Neural Networks into Predator-Prey Models Yves Moreau, St phane Louies 2, Joos Vandewalle, L on renig 2 Katholieke Universiteit Le
Katholieke Universiteit Leuven Departement Elektrotechniek ESAT-SISTA/TR 998-2 Embedding Recurrent Neural Networks into Predator-Prey Models Yves Moreau 2, Stephane Louies 3, Joos Vandewalle 2, Leon renig
More informationThe Kalman filter is arguably one of the most notable algorithms
LECTURE E NOTES «Kalman Filtering with Newton s Method JEFFREY HUMPHERYS and JEREMY WEST The Kalman filter is arguably one of the most notable algorithms of the 0th century [1]. In this article, we derive
More informationLifted approach to ILC/Repetitive Control
Lifted approach to ILC/Repetitive Control Okko H. Bosgra Maarten Steinbuch TUD Delft Centre for Systems and Control TU/e Control System Technology Dutch Institute of Systems and Control DISC winter semester
More informationKrylov Techniques for Model Reduction of Second-Order Systems
Krylov Techniques for Model Reduction of Second-Order Systems A Vandendorpe and P Van Dooren February 4, 2004 Abstract The purpose of this paper is to present a Krylov technique for model reduction of
More informationSubspace-based Identification
of Infinite-dimensional Multivariable Systems from Frequency-response Data Department of Electrical and Electronics Engineering Anadolu University, Eskişehir, Turkey October 12, 2008 Outline 1 2 3 4 Noise-free
More informationUMIACS-TR July CS-TR 2721 Revised March Perturbation Theory for. Rectangular Matrix Pencils. G. W. Stewart.
UMIAS-TR-9-5 July 99 S-TR 272 Revised March 993 Perturbation Theory for Rectangular Matrix Pencils G. W. Stewart abstract The theory of eigenvalues and eigenvectors of rectangular matrix pencils is complicated
More informationClosed-Loop Identification of Unstable Systems Using Noncausal FIR Models
23 American Control Conference (ACC) Washington, DC, USA, June 7-9, 23 Closed-Loop Identification of Unstable Systems Using Noncausal FIR Models Khaled Aljanaideh, Benjamin J. Coffer, and Dennis S. Bernstein
More informationSUBSPACE SYSTEM IDENTIFICATION Theory and applications
SUBSPACE SYSTEM IDENTIFICATION Theory and applications Lecture notes Dr. ing. David Di Ruscio Telemark Institute of Technology Email: david.di.ruscio@hit.no Porsgrunn, Norway January 1995 6th edition December
More informationand the nite horizon cost index with the nite terminal weighting matrix F > : N?1 X J(z r ; u; w) = [z(n)? z r (N)] T F [z(n)? z r (N)] + t= [kz? z r
Intervalwise Receding Horizon H 1 -Tracking Control for Discrete Linear Periodic Systems Ki Baek Kim, Jae-Won Lee, Young Il. Lee, and Wook Hyun Kwon School of Electrical Engineering Seoul National University,
More information8.1 Concentration inequality for Gaussian random matrix (cont d)
MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration
More informationBUMPLESS SWITCHING CONTROLLERS. William A. Wolovich and Alan B. Arehart 1. December 27, Abstract
BUMPLESS SWITCHING CONTROLLERS William A. Wolovich and Alan B. Arehart 1 December 7, 1995 Abstract This paper outlines the design of bumpless switching controllers that can be used to stabilize MIMO plants
More informationSeminar on Linear Algebra
Supplement Seminar on Linear Algebra Projection, Singular Value Decomposition, Pseudoinverse Kenichi Kanatani Kyoritsu Shuppan Co., Ltd. Contents 1 Linear Space and Projection 1 1.1 Expression of Linear
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More informationInformation, Covariance and Square-Root Filtering in the Presence of Unknown Inputs 1
Katholiee Universiteit Leuven Departement Eletrotechnie ESAT-SISTA/TR 06-156 Information, Covariance and Square-Root Filtering in the Presence of Unnown Inputs 1 Steven Gillijns and Bart De Moor 2 October
More informationLie Groups for 2D and 3D Transformations
Lie Groups for 2D and 3D Transformations Ethan Eade Updated May 20, 2017 * 1 Introduction This document derives useful formulae for working with the Lie groups that represent transformations in 2D and
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationAn LQ R weight selection approach to the discrete generalized H 2 control problem
INT. J. CONTROL, 1998, VOL. 71, NO. 1, 93± 11 An LQ R weight selection approach to the discrete generalized H 2 control problem D. A. WILSON², M. A. NEKOUI² and G. D. HALIKIAS² It is known that a generalized
More informationModel reduction via tangential interpolation
Model reduction via tangential interpolation K. Gallivan, A. Vandendorpe and P. Van Dooren May 14, 2002 1 Introduction Although most of the theory presented in this paper holds for both continuous-time
More informationPrediction, filtering and smoothing using LSCR: State estimation algorithms with guaranteed confidence sets
2 5th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 2-5, 2 Prediction, filtering and smoothing using LSCR: State estimation algorithms with
More informationRECURSIVE ESTIMATION AND KALMAN FILTERING
Chapter 3 RECURSIVE ESTIMATION AND KALMAN FILTERING 3. The Discrete Time Kalman Filter Consider the following estimation problem. Given the stochastic system with x k+ = Ax k + Gw k (3.) y k = Cx k + Hv
More informationSubspace Identification A Markov Parameter Approach
Subspace Identification A Markov Parameter Approach Nelson LC Chui JM Maciejowski Cambridge University Engineering Deptartment Cambridge, CB2 1PZ, England 22 December 1998 Technical report CUED/F-INFENG/TR337
More informationProperties of Zero-Free Spectral Matrices Brian D. O. Anderson, Life Fellow, IEEE, and Manfred Deistler, Fellow, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 54, NO 10, OCTOBER 2009 2365 Properties of Zero-Free Spectral Matrices Brian D O Anderson, Life Fellow, IEEE, and Manfred Deistler, Fellow, IEEE Abstract In
More informationProf. Dr.-Ing. Armin Dekorsy Department of Communications Engineering. Stochastic Processes and Linear Algebra Recap Slides
Prof. Dr.-Ing. Armin Dekorsy Department of Communications Engineering Stochastic Processes and Linear Algebra Recap Slides Stochastic processes and variables XX tt 0 = XX xx nn (tt) xx 2 (tt) XX tt XX
More informationLearning a Linear Dynamical System Model for Spatiotemporal
Learning a Linear Dynamical System Model for Spatiotemporal Fields Using a Group of Mobile Sensing Robots Xiaodong Lan a, Mac Schwager b, a Department of Mechanical Engineering, Boston University, Boston,
More informationA note on the characteristic equation in the max-plus algebra
K.U.Leuven Department of Electrical Engineering (ESAT) SISTA Technical report 96-30 A note on the characteristic equation in the max-plus algebra B. De Schutter and B. De Moor If you want to cite this
More information3 Gramians and Balanced Realizations
3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations
More informationProblem Description We remark that this classication, however, does not exhaust the possibilities to assess the model quality; see e.g., Ljung and Guo
Non-Stationary Stochastic Embedding for Transfer Function Graham C. Goodwin eegcg@cc.newcastle.edu.au Estimation Julio H. Braslavsky julio@ee.newcastle.edu.au Department of Electrical and Computer Engineering
More informationBalanced Truncation 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI
More informationNumerical Methods I Solving Square Linear Systems: GEM and LU factorization
Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 18th,
More informationState Space Modeling for MIMO Wireless Channels
State Space Modeling for MIMO Wireless Channels Chengjin Zhang Department of Electrical and Computer Engineering University of California, San Diego San Diego, CA 99-47 Email: zhangc@ucsdedu Robert R Bitmead
More informationSUBSPACE IDENTIFICATION METHODS
SUBSPACE IDENTIFICATION METHODS Katrien De Cock, Bart De Moor, KULeuven, Department of Electrical Engineering ESAT SCD, Kasteelpark Arenberg 0, B 300 Leuven, Belgium, tel: +32-6-32709, fax: +32-6-32970,
More informationPARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT
PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT Hans Norlander Systems and Control, Department of Information Technology Uppsala University P O Box 337 SE 75105 UPPSALA, Sweden HansNorlander@ituuse
More informationFIR Filters for Stationary State Space Signal Models
Proceedings of the 17th World Congress The International Federation of Automatic Control FIR Filters for Stationary State Space Signal Models Jung Hun Park Wook Hyun Kwon School of Electrical Engineering
More informationAPPROXIMATE REALIZATION OF VALVE DYNAMICS WITH TIME DELAY
APPROXIMATE REALIZATION OF VALVE DYNAMICS WITH TIME DELAY Jan van Helvoirt,,1 Okko Bosgra, Bram de Jager Maarten Steinbuch Control Systems Technology Group, Mechanical Engineering Department, Technische
More informationVAR Model. (k-variate) VAR(p) model (in the Reduced Form): Y t-2. Y t-1 = A + B 1. Y t + B 2. Y t-p. + ε t. + + B p. where:
VAR Model (k-variate VAR(p model (in the Reduced Form: where: Y t = A + B 1 Y t-1 + B 2 Y t-2 + + B p Y t-p + ε t Y t = (y 1t, y 2t,, y kt : a (k x 1 vector of time series variables A: a (k x 1 vector
More informationRICE UNIVERSITY. System Identication for Robust Control. Huipin Zhang. A Thesis Submitted. in Partial Fulfillment of the. Requirements for the Degree
RICE UNIVERSITY System Identication for Robust Control by Huipin Zhang A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Approved, Thesis Committee: Athanasios
More information14 - Gaussian Stochastic Processes
14-1 Gaussian Stochastic Processes S. Lall, Stanford 211.2.24.1 14 - Gaussian Stochastic Processes Linear systems driven by IID noise Evolution of mean and covariance Example: mass-spring system Steady-state
More informationLinear algebra for computational statistics
University of Seoul May 3, 2018 Vector and Matrix Notation Denote 2-dimensional data array (n p matrix) by X. Denote the element in the ith row and the jth column of X by x ij or (X) ij. Denote by X j
More informationEmpirical Gramians and Balanced Truncation for Model Reduction of Nonlinear Systems
Empirical Gramians and Balanced Truncation for Model Reduction of Nonlinear Systems Antoni Ras Departament de Matemàtica Aplicada 4 Universitat Politècnica de Catalunya Lecture goals To review the basic
More informationCanonical lossless state-space systems: staircase forms and the Schur algorithm
Canonical lossless state-space systems: staircase forms and the Schur algorithm Ralf L.M. Peeters Bernard Hanzon Martine Olivi Dept. Mathematics School of Mathematical Sciences Projet APICS Universiteit
More informationTutorial on Principal Component Analysis
Tutorial on Principal Component Analysis Copyright c 1997, 2003 Javier R. Movellan. This is an open source document. Permission is granted to copy, distribute and/or modify this document under the terms
More informationFINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez
FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton
More informationDerivation of the Kalman Filter
Derivation of the Kalman Filter Kai Borre Danish GPS Center, Denmark Block Matrix Identities The key formulas give the inverse of a 2 by 2 block matrix, assuming T is invertible: T U 1 L M. (1) V W N P
More informationStatistical and Adaptive Signal Processing
r Statistical and Adaptive Signal Processing Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing Dimitris G. Manolakis Massachusetts Institute of Technology Lincoln Laboratory
More informationVII Selected Topics. 28 Matrix Operations
VII Selected Topics Matrix Operations Linear Programming Number Theoretic Algorithms Polynomials and the FFT Approximation Algorithms 28 Matrix Operations We focus on how to multiply matrices and solve
More informationLMI Based Model Order Reduction Considering the Minimum Phase Characteristic of the System
LMI Based Model Order Reduction Considering the Minimum Phase Characteristic of the System Gholamreza Khademi, Haniyeh Mohammadi, and Maryam Dehghani School of Electrical and Computer Engineering Shiraz
More informationInstitute for Advanced Computer Studies. Department of Computer Science. Two Algorithms for the The Ecient Computation of
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{98{12 TR{3875 Two Algorithms for the The Ecient Computation of Truncated Pivoted QR Approximations
More informationRiccati difference equations to non linear extended Kalman filter constraints
International Journal of Scientific & Engineering Research Volume 3, Issue 12, December-2012 1 Riccati difference equations to non linear extended Kalman filter constraints Abstract Elizabeth.S 1 & Jothilakshmi.R
More informationIntrinsic diculties in using the. control theory. 1. Abstract. We point out that the natural denitions of stability and
Intrinsic diculties in using the doubly-innite time axis for input-output control theory. Tryphon T. Georgiou 2 and Malcolm C. Smith 3 Abstract. We point out that the natural denitions of stability and
More informationECONOMETRIC METHODS II: TIME SERIES LECTURE NOTES ON THE KALMAN FILTER. The Kalman Filter. We will be concerned with state space systems of the form
ECONOMETRIC METHODS II: TIME SERIES LECTURE NOTES ON THE KALMAN FILTER KRISTOFFER P. NIMARK The Kalman Filter We will be concerned with state space systems of the form X t = A t X t 1 + C t u t 0.1 Z t
More informationAn overview of subspace identification
Computers and Chemical Engineering 30 (2006) 1502 1513 An overview of subspace identification S Joe Qin Department of Chemical Engineering, The University of Texas at Austin, Austin, TX 78712, USA Received
More information