A measure of the tracking capability of recursive stochastic algorithms with constant gains

DOI10.1109/TAC.1982.1102981zbMath0495.93070MaRDI QIDQ3959866

Gabriel Ruget, Albert Benveniste

Publication date: 1982

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

zbMATH Keywords

algebraic Riccati equationKalman filterfactorizationrecursive least squares algorithmdigital phase-locked looptracking capabilitydispersive channels

Mathematics Subject Classification ID

Related Items (11)

Convergence rate determination for gradient-based adaptive estimators ⋮ Adaptive forgetting in recursive identification through multiple models† ⋮ Uncertainties for recursive estimators in nonlinear state-space models, with applications to epidemiology ⋮ The method of averaged models for discrete-time adaptive systems ⋮ Steady-state and parameter tracking properties of self-tuning minimum variance regulators ⋮ On the asymptotic accuracy of pseudo-linear regression algorithms ⋮ Adaptation and tracking in system identification - a survey ⋮ Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size ⋮ Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents ⋮ Tracking error bounds of adaptive nonstationary filtering ⋮ Behaviour of the output error identification algorithm for small stepsize gains

This page was built for publication: A measure of the tracking capability of recursive stochastic algorithms with constant gains