Abstract (EN):
In this paper two recursive algorithms are presented, based on NB-N4SID
subspace identification algorithm. The main idea was to show that subspace identification
methods can be represented as sequences of least squares problems and implemented
through sequences of modified Householder algorithms. 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-time applications and
minimize the computational burden.
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
6