Persistency of excitation, identification, and radial basis functions

Discusses identification algorithms whose convergence and rate of convergence hinge on the regressor vector being persistently exciting. The authors then show that if the regressor vector is constructed out of radial-basis-function approximants, it will be persistently exciting, provided a kind of "ergodic" condition is satisfied. In addition, the authors provide bounds on parameters associated with the persistently exciting regressor vector; these parameters are connected both with the convergence and rates of convergence of the algorithms involved.<
>