Polynomial Chaos based on the parallelized ensemble Kalman filter to estimate precipitation states

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This article develops a methodology combining methods of numerical analysis and stochastic differential equations with computational algorithms to treat problems which have complex nonlinear dynamics in high dimensions. A method to estimate parameters and states of a dynamic system is proposed inspired by the parallelized ensemble Kalman filter (PEnKF) and the polynomial chaos theory of Wiener-Askey. The main advantage of the proposal is in providing a precise efficient algorithm with low computational cost. For the analysed data, the methods provide good predictions, spatially and temporally, for the unknown precipitation states for the first 24 hours. Two goodness of fit measures provide confidence in the quality of the model predictions. The performance of the parallel algorithm, measured by the acceleration and efficiency factors, shows an increase of 7% in speed with respect to the sequential version and is most efficient for P = 2 threads.

Cite

CITATION STYLE

APA

Sánchez, L., Infante, S., Marcano, J., & Griffin, V. (2015). Polynomial Chaos based on the parallelized ensemble Kalman filter to estimate precipitation states. Statistics, Optimization and Information Computing, 3(1), 79–95. https://doi.org/10.19139/soic.v3i1.113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free