1992
DOI: 10.1080/00207179208934228
|View full text |Cite
|
Sign up to set email alerts
|

Recursive forgetting algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
44
0

Year Published

1998
1998
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 98 publications
(44 citation statements)
references
References 4 publications
0
44
0
Order By: Relevance
“…In fact, P\ R can also be generated directly as the solution of an ODE analogous to (18). This saves computing the inverse continually to obtain the latest estimate of ) R .…”
Section: Remark 24mentioning
confidence: 99%
“…In fact, P\ R can also be generated directly as the solution of an ODE analogous to (18). This saves computing the inverse continually to obtain the latest estimate of ) R .…”
Section: Remark 24mentioning
confidence: 99%
“…However if the sequence of regression vectors (k) is not su$ciently exciting, the eigenvalues of P(k) will grow without limit. The resulting problems are discussed for example in Parkum, Poulsen and Holst (1992) and in Bittanti, Bolzern and Campi (1990). In order to solve this problem Parkum et al (1992) proposed the following two steps procedure to implement (11):…”
Section: Selective Forgetting Methods For Least-squares Recursive Estimentioning
confidence: 99%
“…These will not all be discussed in detail here, but can be found in the following references. [30][31][32][33][34] One such technique -similar to that of Parkum et al…”
Section: Reducing Laukf Divergence In the Steady Statementioning
confidence: 99%