๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Towards more precise recursive prediction error algorithms

โœ Scribed by Roman Weinfeld


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
328 KB
Volume
26
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper presents a variant of the Recursive Gauss-Newton algorithm for identification of the model

To derive the algorithm the formulae for the predictor and its derivatives have been transformed and then applied to build up more exact schema for the evaluation of the gradient and the Hessian. The tests show that this algorithm has an important advantage in that it converges, in general, substantially faster than the conventional one. It turns out that the presented idea, as a tool, is of a very general nature and might be applied to other algorithms.


๐Ÿ“œ SIMILAR VOLUMES


Recursive prediction error algorithms wi
โœ Haim Weiss; John B. Moore ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 507 KB

In this paper, recursive prediction error identification schemes are studied which incorporate Kalman gain calculations to ensure exponential stability of the predictor and related recursions. Thus there is an alternative to the trial and error projection techniques and stability test calculations o

Analysis of a general recursive predicti
โœ Lennart Ljung ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 979 KB

A general recursive identification algorithm is found to have the same convergence properties as a family of off-line prediction error methods.