A nearly interpolatory algorithm for Η ∞ identification with mixed time and frequency response data
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.
Publication Source (Journal or Book title)
IEEE Transactions on Automatic Control
Gu, G., & Chen, J. (2001). A nearly interpolatory algorithm for Η ∞ identification with mixed time and frequency response data. IEEE Transactions on Automatic Control, 46 (3), 464-469. https://doi.org/10.1109/9.911425