Abstract
An ordinary differential equation technique is developed via averaging theory and weak convergence theory to analyze the asymptotic behavior of continuous-time recursive stochastic parameter estimators. This technique is an extension of L. Ljung's (1977) work in discrete time. Using this technique, the following results are obtained for various continuous-time parameter estimators. The recursive prediction error method, with probability one, converges to a minimum of the likelihood function. The same is true of the gradient method. The extended Kalman filter fails, with probability one, to converge to the true values of the parameters in a system whose state noise covariance is unknown. An example of the extended least squares algorithm is analyzed in detail. Analytic bounds are obtained for the asymptotic rate of convergence of all three estimators applied to this example. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
