Naive approximate realization of noisy data

A. Hajdasinski, P. van den Hof, A. Damen

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


This paper presents suboptimal solutions to the problem of Approximate Partial Realization: given a multivariable formal power series of finite length, a state space description has to be constructed with limited dimension, in such a way that it approximates the available matrix sequence with respect to some specific criterion. The methods based on the Ho-Kalman algorithm and employing a Hankel matrix or an alternative to it, a Page matrix, fail theoretically but appear to be practically quite useful. Results of the simulations allow us to determine in which cases the Hankel or Page matrix approach would be more appropriate.

Original languageEnglish
Pages (from-to)699-704
Number of pages6
JournalIFAC Proceedings Volumes
Issue number2
Publication statusPublished - 1 Jul 1984
Event9th World Congress of the International Federation of Aufomatic Control (IFAC 1984 World Congress) : A Bridge Between Control Science and Technology - Budapest, Hungary
Duration: 2 Jul 19846 Jul 1984
Conference number: 9


Dive into the research topics of 'Naive approximate realization of noisy data'. Together they form a unique fingerprint.

Cite this