A directional forgetting algorithm based on the decomposition of the information matrix is presented. Theoretical studies show that the algorithm has desirable properties, such as to forget old data according to the information content in various directions, above and below bounded information matrix. Compared with various modifications to the exponential forgetting algorithm, the new algorithm is simple in the sense that there are only two adjustable parameters that can be easily prespecified. These properties make this algorithm an attractive selection for online identification.

dx.doi.org/10.1016/S0005-1098(00)00093-5
Automatica
Department of Systems and Computer Engineering

Cao, L. (Liyu), & Schwartz, H.M. (2000). Directional forgetting algorithm based on the decomposition of the information matrix. Automatica, 36(11), 1725–1731. doi:10.1016/S0005-1098(00)00093-5