Abstract (EN):
In this paper we present two subspace identification methods implemented through sequences of modified Householder algorithm. The main idea was to show that subspace identification methods can be represented as sequences of least squares problems and implemented wing QR factorizations. Therefore, it is possible to develop iterative algorithms with most of the advantages of this kind of methods, and still improve the numerical efficiency, in order to deal with real-tme applications and minimize the computational burden.
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
6