Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds

A linear algorithm and a nonlinear algorithm for the problem of system identification in H/sub infinity / posed by Helmicki et al. (1990) for discrete-time systems are presented. The authors derive some error bounds for the linear algorithm which indicate that it is not robustly convergent. However, the worst-case identification error is shown to grow as log(n), where n is the model order. A robustly convergent nonlinear algorithm is derived, and bounds on the worst-case identification error (in the H/sub infinity / norm) are obtained.<
>