An executable and asymptotically optimal adaptive RLS algorithm

Description

A setting method for the forgetting factor in recursive least squares (RLS) algorithms is presented. In a general adaptive setting method, to obtain the optimal value of the forgetting factor, the cost function constructed with the mean squared prediction errors is differentiated and the derivative that is set to zero is solved numerically. The problem of this method is that just one of local minimums is obtained unless the cost function is confirmed as unimodal. The main object of this contribution is to show the unimodality of the cost function of the RLS algorithm.

Journal

Details 詳細情報について

Report a problem

Back to top