Abstract

The recursive least squares technique is often extended with exponential forgetting as a tool for parameter estimation in time-varying systems. The distribution of the resulting parameter estimates is, however, unknown when the forgetting factor is less than one. In this paper an approximative expression for bias of the recursively obtained parameter estimates in a time-invariant AR(na) process with arbitrary noise is given, showing that the bias is non-zero and giving bounds on the approximation errors. Simulations confirm the approximation expressions.

Full Text
Paper version not known

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 call

Disclaimer: 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.