A nearly interpolatory algorithm for Η ∞ identification with mixed time and frequency response data

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

2 Scopus Citations
View graph of relations



Original languageEnglish
Pages (from-to)464-469
Journal / PublicationIEEE Transactions on Automatic Control
Issue number3
Publication statusPublished - Mar 2001
Externally publishedYes


A new algorithm is proposed for Η infin; identification with mixed-time and frequency-response data. This algorithm shares similar properties to interpolatory algorithms, and is nearly interpolatory. Meanwhile, it greatly reduces the computational complexity of the interpolatory algorithm. Worst-case identification error bounds are also characterized, and derived for this nearly interpolatory algorithm. A numerical example is used to illustrate the proposed identification algorithm.

Research Area(s)

  • Η infin