Exact initialization of the recursive least‐squares algorithm

We present an initialization procedure for the recursive least‐squares (RLS) algorithm that has almost the same form as the RLS algorithm itself and which is exact in the sense that the so‐initialized RLS estimate coincides with the batch LS estimate as soon as the latter exists.