A Recursive Algorithm for Least Squares Estimation with a Sliding Window Based on J-Orthogonal QR Factorization

View at publisher Summarise with VIRAT
Authors: Masato Ikenoue
Cited by: 0
References: 7

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

When estimating parameters in time-varying systems using data that exhibit sharp changes, it is desirable to place greater emphasis on newer data than on older data. The sliding window method is an effective approach that reduces the influence of older data by discarding it as new data arrive. This allows parameter estimation to be performed using only the most recent data within a fixed-size window. This study considers a recursive algorithm for the least squares estimation with a sliding window. The least squares estimate with the sliding window can be viewed as an estimate with updating and downdating of data. A new, efficient, and numerically stable recursive algorithm is proposed using QR factorization for the updating step and J-orthogonal QR factorization for the downdating step.

Fields of Study & Subjects

Statistical and numerical algorithms Control Systems and Identification Matrix Theory and Algorithms

Publication details

Journal / source
Transactions of the Society of Instrument and Control Engineers
Volume
62
Issue
3
Pages
110–120
Publication date
1 January 2026
Language
EN