Worst-case asymptotic properties of linear algorithms for H/sub /spl infin// identification

This paper considers asymptotic properties for linear algorithms in H/sub /spl infin// identification. The divergence of linear algorithms is characterized for H/sub /spl infin// identification in both time and frequency domain. The sample complexity issue is also investigated. The results of this paper complement the existing results for linear algorithms in H/sub /spl infin// identification.