An executable and asymptotically optimal adaptive RLS algorithm

説明

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.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ