RLS parameter convergence with overparameterized models
This paper makes use of the Lyapunov type function approach to generalize in several directions the existing results on the convergence properties of the recursive least-squares (RLS) algorithm applied to (noise-free) linear time-invariant difference equations. More specifically, the paper treats the case of overparameterized models, without assuming a priori knowledge of the degree of overparameterization; in addition, the weakest possible condition of excitation is imposed. The RLS estimate is shown to converge in a parameter set H the elements of which correspond to reducible parameterizations of the (irreducible) true transfer function. The initial conditions of the RLS algorithm are shown to be qualitatively related to the convergence points of the RLS. In particular, if the condition number of the initial covariance matrix in the RLS algorithm is chosen to be equal to one, then the algorithm will converge to the unique point in H which is closest to the initial parameter estimates (such a point always exists as H is a closed convex set).
- Adaptive RLS algorithms under stochastic excitation-L/sup 2/ convergence analysis
- New insights into the RLS algorithm
- Recursive least squares with linear constraints
- Adaptive RLS algorithms under stochastic excitation. - Strong consistency analysis
- On consistency of recursive least squares identification algorithms for controlled auto-regression models
- Analysis of recursive stochastic algorithms
- Exponential convergence of adaptive identification and control algorithms
- Extended least squares and their applications to adaptive control and prediction in linear systems
- scientific article; zbMATH DE number 3875113 (Why is no real title available?)
- scientific article; zbMATH DE number 4066707 (Why is no real title available?)
- scientific article; zbMATH DE number 3997615 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- On adaptive estimation and pole assignment of overparametrized systems
- On the concept of excitation in least squares identification and adaptive control†
- Persistence of excitation in extended least squares
- Persistency of excitation for nonminimal models of systems having purely deterministic disturbances
- Persistency of excitation in the presence of possibly unbounded signals
- Persistency of excitation results for structured nonminimal models
- Recursive identification of overparametrized systems
- Remarks on persistency of excitation for nonminimal models of systems having purely deterministic disturbances
- The convergence of AML
- Stability of an overparametrized model
- Necessary and sufficient regressor conditions for the global asymptotic stability of recursive least squares
- Modified recursive least-squares algorithm for parameter identification
- Overparameterized model parameter recovering with finite-time convergence
- Analysis of overshoot phenomena in initialisation stage of RLS algorithm
This page was built for publication: RLS parameter convergence with overparameterized models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119237)