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

Recursive prediction error algorithms without a stability test

โœ Scribed by Haim Weiss; John B. Moore


Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
507 KB
Volume
16
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 of earlier schemes with no compromise on convergence rate or computational effort. The resulting algorithms are then attractive for a wide range of applications.


๐Ÿ“œ SIMILAR VOLUMES


Towards more precise recursive predictio
โœ Roman Weinfeld ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 328 KB

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. T

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.

Direct design of recursive digital filte
โœ V. Ramachandran; C.S. Gargour; M. Ahmadi; M.T.H. Boraie ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 383 KB

In this paper we present an alternative approach to the direct design of 1-D recursive digitalfilters satisfying prescribed magnitude specifications with or without constant group delay characteristic. This method uses an iterative method to calculate the coejkients of the$lter's transfer,function a