Abstract

Existing recursive parameter estimation methods use approximated covariance and gradient matrices which are actually computed as functions of the present parameter vector thetaŝ(t) by the matrices computed as functions of all previous parameter estimates thetaŝ(i) for i ≤ t. By reducing the approximations considerably, modified versions of the recursive identification algorithms are obtained. Considering the local averages of the covariance and the gradient and clubbing conveniently with the block nature of estimators, efficient block versions of these algorithms are obtained.

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.