𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Performance analysis of the forgetting factor RLS algorithm

✍ Scribed by Lei Guo; Lennart Ljung; Pierre Priouret


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
565 KB
Volume
7
Category
Article
ISSN
0890-6327

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Convergence analysis of the RLS identifi
✍ B. Lindoff; J. Holst πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 171 KB πŸ‘ 2 views

The recursive least-squares (RLS) identiΓΏcation algorithm is often extended with exponential forgetting as a tool for parameter estimation in time-varying stochastic systems. The statistical properties of the parameter estimates obtained from such an extended RLS-algorithm depend in a non-linear way

Forgetting factor algorithm and its appl
✍ Zunjian Zhang; Bingren Xiang; Dengkui An πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 475 KB

## AbStIWt A forgetting factor algorithm was evaluated and introduced in the simultaneous multi-component assay of mixtures. Three kinds of preparation, a compound injection of antipyrine, a three-acid powder and a four-acid powder, were analysed with satisfactory results. Estimates obtained by Ka

High-Performance Heterogeneous Computing
✍ Lastovetsky, Alexey L.; Dongarra, Jack J. πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley & Sons, Inc. 🌐 English βš– 128 KB πŸ‘ 1 views

an Analytical Overview Of The State Of The Art, Open Problems, And Future Trends In Heterogeneous Parallel And Distributed Computing this Book Provides An Overview Of The Ongoing Academic Research, Development, And Uses Of Heterogeneous Parallel And Distributed Computing In The Context Of Scientifi

Performance analysis for crossover opera
✍ Kengo Katayama; Hisayuki Hirabayashi; Hiroyuki Narihisa πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

In this paper, we deal with promising crossover operators developed in the genetic algorithm (GA) and analyze the performance of these crossovers on the traveling salesman problem (TSP) which is one of the most popular NP-hard problems. Many crossovers that efficiently generate good solutions have b