The extended Kalman filter (EKF) algorithm has been shown to be advantageous for neural network trainings. However, unlike the backpropagation (BP), many matrix operations are needed for the EKF algorithm and therefore greatly increase the computational complexity. This paper presents a method to do
Parallel Kalman filter networks for kinetic methods of analysis
β Scribed by Peter D. Wentzell; Stephen J. Vanslyke
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 780 KB
- Volume
- 257
- Category
- Article
- ISSN
- 0003-2670
No coin nor oath required. For personal study only.
β¦ Synopsis
AbStiCt An algonthm for the correctIon of errors ansmg from between-sample vanatlons m the pseudo-first-order rate constant for kmetlc methods IS dermbed The algonthm 1s based on the hnear Kalman filter and uses a set of models (typically 40 or more) m parallel The best model for a given set of data IS selected by exammatlon of the mnovation sequences Lmutattons of this approach with respect to data range, number of data points and measurement noise were mvestlgated with simulated data ExperImental data from the molybdenum blue method for the determmatlon of phosphate were used to demonstrate the msensltlvlty of the algonthm to vanatlons m the rate constant Prmc~pal advantages of the new method over other error-compensatron methods are Its srmphaty, adaptabdlty, stabdlty, fmed cycle time and memory reqmrements, and Its ablhty to provide results m only one pass through the data The method can be used m real time and IS well suited for dlgltal slgnal processors and parallel computmg architectures Keywords Kmetrc analysts, Error correction, Kalman filter
π SIMILAR VOLUMES
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
The graphical method and the iterative method for analysing kinetic data for metal speciation in waters are described. The graphical method involves successive subtractions of one component from the total concentration of the metal remaining, beginning with the slowest component. The iterative metho
A parallel computational implementation of modern meshless methods is presented for explicit dynamic analysis. The procedures are demonstrated by application of the Reproducing Kernel Particle Method (RKPM). Aspects of a coarse grain parallel paradigm are detailed for a Lagrangian formulation using