Exponential convergence of adaptive identification and control algorithms

Output and equation error adaptive identification algorithms are shown to be exponentially convergent under a deterministic or stochastic persistently exciting (or spanning) condition on the system inputs together with several other standard conditions. An adaptive control algorithm is shown to be exponentially convergent under a deterministic or stochastic persistently exciting condition on the reference trajectory together with some standard conditions.