✦ LIBER ✦

Error analysis algorithms for distributed parameter filtering

✍ Scribed by G.R.V. Kumar; A.P. Sage

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 307 KB
Volume: 8
Category: Article
ISSN: 0005-1098
DOI: 10.1016/0005-1098(72)90056-8

No coin nor oath required. For personal study only.

✦ Synopsis

Interest in estimation in distributed parameter linear systems is increasing. Unfortunately, algorithms for filtering in distributed parameter systems are quite complex and thus suboptimization will often, in practice, be necessary. Also incorrect models for distributed processes and prior statistics lead to filter algorithms which are not optimal. This paper presents the derivation of error analysis algorithms for filtering in distributed parameter systems.

📜 SIMILAR VOLUMES

Smoothing algorithms for nonlinear distr

Smoothing algorithms for nonlinear distributed parameter systems

✍ R. Sahgal; R.P. Webb 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Smoothing algorithms for nonlinear distributed systems, can substantially reduce the error covariance vis-tt-vis filtering. SnmmarT--Fixed interval and fixed-lag smoothing algorithms are developed for a class of noisy nonlinear dism'buted parameter systems with unknown volume disturbances. Using a

Least-squares filtering and smoothing fo

Least-squares filtering and smoothing for linear distributed parameter systems

✍ J.S. Meditch 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 628 KB

FILTERED REFERENCE AND FILTERED ERROR LM

FILTERED REFERENCE AND FILTERED ERROR LMS ALGORITHMS FOR ADAPTIVE FEEDFORWARD CONTROL

✍ S.J. Elliott 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 214 KB

A unified and consistent formulation is developed for both filtered reference and filtered error forms of the instantaneous steepest descent, or LMS, algorithm when used to adapt FIR feedforward controllers. Both algorithms minimise the mean-square value of the same, output, error function. The two

The Kantorovich inequality for error ana

The Kantorovich inequality for error analysis of the Kalman filter with unknown noise distributions

✍ James C. Spall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 639 KB

The state-space model with random noises is widely used to model dynamic systems. In many practical problems the noise terms will have unknown probability distributions, which is contrary to the usual ussumption of Gaussian noises made in state-vector estimation; this assumption is usually made for

A rapidly converging filtered-error algo

A rapidly converging filtered-error algorithm for multichannel active noise control

✍ A. P. Berkhoff; G. Nijsse 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB 👁 1 views

Efficient algorithm for “on-the-fly” err

Efficient algorithm for “on-the-fly” error analysis of local or distributed serially correlated data

✍ David R. Kent IV; Richard P. Muller; Amos G. Anderson; William A. Goddard III; M 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract We describe the Dynamic Distributable Decorrelation Algorithm (DDDA) which efficiently calculates the true statistical error of an expectation value obtained from serially correlated data “on‐the‐fly,” as the calculation progresses. DDDA is an improvement on the Flyvbjerg‐Petersen renor