Exponential convergence and persistent excitation

Brian D. O. Anderson · 1982

The notion of robustness of an adaptive algorithm is discussed. A number of simple examples are given of adaptive algorithms behaving in a nonrobust manner, and then conditions for robustness are presented which demand use of persistently exciting signals.

Read the paper · More papers on PaperTik