𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counter example to the exponential convergence of the directional forgetting algorithm

✍ Scribed by S. Bittanti; P. Bolzern; M. Campi

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
380 KB
Volume
4
Category
Article
ISSN
0890-6327

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Convergence analysis of the RLS identifi
Convergence analysis of the RLS identification algorithm with exponential forgetting in stationary ARX-structures
✍ B. Lindoff; J. Holst πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 171 KB πŸ‘ 1 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

Applications and new developments of the
Applications and new developments of the direct exponential curve resolution algorithm (DECRA). Examples of spectra and magnetic resonance images
✍ Willem Windig; Brian Antalek; Louis J. Sorriero; Sabina Bijlsma; D. J. Louwerse πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

Recently, a new multivariate analysis tool was developed to resolve mixture data sets, where the contributions ('concentrations') have an exponential profile. The new approach is called DECRA (direct exponential curve resolution algorithm). DECRA is based on the generalized rank annihilation method