Published January 1, 1998 | Version v1
Journal article Open

Algorithms for robust identification in H-infinity with nonuniformly spaced frequency response data

Creators

Description

In this paper, first a two-stage robustly convergent identification algorithm in H-infinity for nonuniformly spaced data is proposed. The worst-case error of the algorithm converges to zero faster than polynomial rates in the noise-free case when the identified system is an exponentially stable discrete-time system. The algorithm is characterized by a rational interpolation step with fixed poles at zero and infinity. Next, a minimax algorithm with better convergence properties is introduced. Sensitivity of the algorithms to small variations in the frequency values is also studied.

Files

bib-e7d05ee0-dbee-4163-b3ed-4860b1c2324a.txt

Files (178 Bytes)

Name Size Download all
md5:89bae4a4a9d7520c8d6413a467bb7d5c
178 Bytes Preview Download