Abstract
In this paper, a hybrid recursive least squares (HRLS) algorithm for online identification using sequential chunk-by-chunk observations is proposed. By employing the optimization-based least squares (O-LS), the HRLS can be initialized with any chunk of data samples and works successively in two recursive procedures for updating the inverse matrix with minimal dimension and least rank-deficiency, and thereby contributing to fast and stable online identification. Since norms of the output weight and training errors are minimized simultaneously, the HRLS achieves high accuracy in terms of both generalization and approximation. Simulation studies and comprehensive comparisons demonstrate that the HRLS is numerically more stable and superior to other algorithms in terms of accuracy and speed.
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.
