Recursive least squares estimation with rank two updates

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents new recursive least squares (RLS) algorithms with enhanced performance, achieved via a combination of exponential forgetting and windowing techniques. The proposed algorithms with rank two updates are systematically aligned with established RLS algorithms with rank one updates to ensure unification and clarity. Newly identified properties of the recursive algorithms, associated with the convergence of both the inverse of the information matrix and the parameter estimates which are presented in this paper, offer great potential for further enhancement of the estimation performance. The proposed algorithms demonstrate significant improvements in the estimation of the grid events in the presence of substantial harmonic emissions.

Cite

CITATION STYLE

APA

Stotsky, A. (2025). Recursive least squares estimation with rank two updates. Automatika, 66(4), 619–624. https://doi.org/10.1080/00051144.2025.2517431

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free