𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalized algorithm for the recursive implementation of polynomial filters

✍ Scribed by P. Agathoklis; H. Xu


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
644 KB
Volume
327
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis


Polynomial jilters have many applications in real time control, estimation and identification, particularly when information about the system dynamics and noise statistics are not precisely known. In this paper, a generalized recursive algorithm for nth order polynomial jilters is developed. The parameters of the jilter are determined by applying a weighted least-squares performance index, and thus the stability of the polynomial jilter is guaranteed. The implementations of the nonrecursive and the recursive polynomialjlters are obtained and the performance of both implementations is compared.


πŸ“œ SIMILAR VOLUMES


A Combinatorial Proof of a Recursion for
✍ Kendra Killpatrick πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 196 KB

The Kostka numbers K \* + play an important role in symmetric function theory, representation theory, combinatorics and invariant theory. The q-Kostka polynomials K \* + (q) are the q-analogues of the Kostka numbers and generalize and extend the mathematical meaning of the Kostka numbers. Lascoux an