subspace algorithms for the stochastic identification problem1

0 downloads 0 Views 198KB Size Report
State Science Policy Programming (Prime Minister's O ce) and the Euro- pean Community ... An illustrative examples is given in section 8. 2. Linear time ..... Qt. 1. Qt. 2 ! where both A and B are of full row rank and consider a QSVD of the matrix ...
SUBSPACEIDENTIFICATION ALGORITHMS FOR THE STOCHASTIC PROBLEM 1

Peter Van Overschee Bart De Moor 2

3

ESAT , Department of Electrical Engineering , Katholieke Universiteit Leuven Kardinaal Mercierlaan 94 , 3001 Leuven (Heverlee) , Belgium tel: 32/16/220931 fax: 32/16/221855 email: [email protected] , [email protected]

Abstract In this paper, we derive a new algorithm to consistently identify stochastic state space models from given output data without forming the covariance matrix and using only semi-innite block Hankel matrices. The algorithm is based on the concept of principal angles and directions. We describe how they can be calculated with only QR and QSVD decompositions. We also provide an interpretation of the principal directions as states of a non-steady state Kalman lter.

1. Introduction Let yk 2