
doi: 10.1109/29.1635
The three prewindowed transversal fast RLS algorithms, the FK (fast Kalman), FAEST (fast a posteriori estimation sequential technique), and FTF (fast transversal filter) algorithms are derived in a unified approach. We show that their mathematical equivalence can be established only by properly choosing their initial conditions. It is confirmed by computer simulations that the choice of initial conditions and the algorithmic forgetting factor could strongly affect the speed of the initial convergence.
Finite difference methods for boundary value problems involving PDEs, Estimation and detection in stochastic control theory, convergence, Computational methods in stochastic control, Filtering in stochastic control theory, unified approach, forgetting factor, Sequential estimation, prewindowed transversal fast RLS algorithms, computer simulations
Finite difference methods for boundary value problems involving PDEs, Estimation and detection in stochastic control theory, convergence, Computational methods in stochastic control, Filtering in stochastic control theory, unified approach, forgetting factor, Sequential estimation, prewindowed transversal fast RLS algorithms, computer simulations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
