Title

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

Document Type

Article

Publication Date

3-1-2001

Abstract

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

First Page

464

Last Page

469

This document is currently not available here.

COinS