PERSISTENCY OF EXCITATION, IDENTIFICATION, AND RADIAL BASIS FUNCTIONS Conference Paper

abstract

• In this paper, we discuss identification algorithms whose convergence and rate of convergence hinge on the regressor vector being persistently exciting. We 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, we will 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.

authors

• Narcowich, Francis
• Ward, Joseph

published proceedings

• PROCEEDINGS OF THE 33RD IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4

author list (cited authors)

• KURDILA, A. J., NARCOWICH, F. J., & WARD, J. D.

complete list of authors

• KURDILA, AJ||NARCOWICH, FJ||WARD, JD

publication date

• December 1994

published in

• IEEE Conference on Decision and Control  Journal

International Standard Book Number (ISBN) 10

• 0-7803-1968-0

start page

• 2273

end page

• 2278

volume

• 3