Abstract
This paper presents an approach for constructing probabilistic approximation type algorithms used in system identification systems. The proposed approach allows obtaining recursive identification algorithms under fairly mild assumptions about noise and disturbances that distort the system. The obtained algorithm does not require inversion of the Hessian of the identification criterion and is robust to changes in the order of the Hessian. This example demonstrates good convergence properties of the obtained algorithm compared to conventional recursive systems.
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.
