A Hybrid Ensemble Transform Particle Filter for Nonlinear and Spatially Extended Dynamical Systems

2016 ◽  
Vol 4 (1) ◽  
pp. 592-608 ◽  
Author(s):  
Nawinda Chustagulprom ◽  
Sebastian Reich ◽  
Maria Reinhardt
1997 ◽  
Vol 56 (2) ◽  
pp. 2276-2278 ◽  
Author(s):  
P.-M. Binder ◽  
Juan F. Jaramillo

2011 ◽  
Vol 11 (02n03) ◽  
pp. 569-591 ◽  
Author(s):  
HOONG CHIEH YEONG ◽  
JUN HYUN PARK ◽  
N. SRI NAMACHCHIVAYA

The study of random dynamical systems involves understanding the evolution of state variables that contain uncertainties and that are usually hidden, or not directly observable. Therefore, state variables have to be estimated and updated based on system models using information from observational data, which themselves are noisy, in the sense that they contain uncertainties and disturbances due to imperfections in observational devices and disturbances in the environment within which data are being collected. The development of efficient data assimilation methods for integrating observational data in predicting the evolution of random state variables is thus an important aspect in the study of random dynamical systems. In this paper, we consider a particle filtering approach to nonlinear filtering in multiscale dynamical systems. Particle filtering methods [1–3] utilizes ensembles of particles to represent the conditional density of state variables using particle positions, distributed over a sample space. The distribution of an ensemble of particles is updated using observational data to obtain the best representation of the conditional density of the state variables of interest. On the other hand, homogenization theory [4, 5], allows us to estimate the coarse-grained (slow) dynamics of a multiscale system on a larger timescale without having to explicitly study the fast variable evolution on a small timescale. The results of filter convergence presented in [6] shows the convergence of the filter of the actual state variable to a homogenized solution to the original multiscale system, and thus we develop a particle filtering scheme for multiscale random dynamical systems that utilizes this convergence result. This particle filtering method is called the Homogenized Hybird Particle Filter, and it incorporates a multiscale computation scheme, the Heterogeneous Multiscale Method developed in [7], with the novel branching particle filter described in [8–10]. By incorporating a multiscale scheme based on homogenization of the original system, estimation of the coarse-grained dynamics using observational data is performed over a larger timescale, thus resulting in computational time and cost reduction in terms of the evolution of the state variables as well as functional evaluations for the filtering aspect. We describe the theory behind this combined scheme and its general algorithm, concluded with an application to the Lorenz-96 [11] atmospheric model that mimics midlatitude geophysical dynamics with microscopic convective processes.


Author(s):  
П.В. Полухин

В работе предложены математические инструменты на основе достаточных статистик и декомпозиции выборок в сочетании с алгоритмами распределенных вычислений, позволяющие существенно повысить эффективность процедуры фильтрации. Filtering algorithms are used to assess the state of dynamic systems when solving various practical problems, such as voice synthesis and determining the geo-position and monitoring the movement of objects. In the case of complex hierarchical dynamic systems with a large number of time slices, the process of calculating probabilistic characteristics becomes very time-consuming due to the need to generate a large number of samples. The essence of optimization is to reduce the number of samples generated by the filter, increase their consistency and speed up computational operations. The paper offers mathematical tools based on sufficient statistics and sample decomposition in combination with distributed computing algorithms that can significantly improve the efficiency of the filtering procedure.


1996 ◽  
Vol 76 (15) ◽  
pp. 2686-2689 ◽  
Author(s):  
Giovanni Giacomelli ◽  
Antonio Politi

2018 ◽  
Vol 25 (4) ◽  
pp. 731-746 ◽  
Author(s):  
Sangeetika Ruchi ◽  
Svetlana Dubinkina

Abstract. Over the years data assimilation methods have been developed to obtain estimations of uncertain model parameters by taking into account a few observations of a model state. The most reliable Markov chain Monte Carlo (MCMC) methods are computationally expensive. Sequential ensemble methods such as ensemble Kalman filters and particle filters provide a favorable alternative. However, ensemble Kalman filter has an assumption of Gaussianity. Ensemble transform particle filter does not have this assumption and has proven to be highly beneficial for an initial condition estimation and a small number of parameter estimations in chaotic dynamical systems with non-Gaussian distributions. In this paper we employ ensemble transform particle filter (ETPF) and ensemble transform Kalman filter (ETKF) for parameter estimation in nonlinear problems with 1, 5, and 2500 uncertain parameters and compare them to importance sampling (IS). The large number of uncertain parameters is of particular interest for subsurface reservoir modeling as it allows us to parameterize permeability on the grid. We prove that the updated parameters obtained by ETPF lie within the range of an initial ensemble, which is not the case for ETKF. We examine the performance of ETPF and ETKF in a twin experiment setup, where observations of pressure are synthetically created based on the known values of parameters. For a small number of uncertain parameters (one and five) ETPF performs comparably to ETKF in terms of the mean estimation. For a large number of uncertain parameters (2500) ETKF is robust with respect to the initial ensemble, while ETPF is sensitive due to sampling error. Moreover, for the high-dimensional test problem ETPF gives an increase in the root mean square error after data assimilation is performed. This is resolved by applying distance-based localization, which however deteriorates a posterior estimation of the leading mode by largely increasing the variance due to a combination of less varying localized weights, not keeping the imposed bounds on the modes via the Karhunen–Loeve expansion, and the main variability explained by the leading mode. A possible remedy is instead of applying localization to use only leading modes that are well estimated by ETPF, which demands knowledge of which mode to truncate.


2001 ◽  
Vol 7 (3) ◽  
pp. 277-301 ◽  
Author(s):  
Gina M. B. Oliveira ◽  
Pedro P. B. de Oliveira ◽  
Nizam Omar

Cellular automata (CA) are important as prototypical, spatially extended, discrete dynamical systems. Because the problem of forecasting dynamic behavior of CA is undecidable, various parameter-based approximations have been developed to address the problem. Out of the analysis of the most important parameters available to this end we proposed some guidelines that should be followed when defining a parameter of that kind. Based upon the guidelines, new parameters were proposed and a set of five parameters was selected; two of them were drawn from the literature and three are new ones, defined here. This article presents all of them and makes their qualities evident. Then, two results are described, related to the use of the parameter set in the Elementary Rule Space: a phase transition diagram, and some general heuristics for forecasting the dynamics of one-dimensional CA. Finally, as an example of the application of the selected parameters in high cardinality spaces, results are presented from experiments involving the evolution of radius-3 CA in the Density Classification Task, and radius-2 CA in the Synchronization Task.


2020 ◽  
Vol 148 (11) ◽  
pp. 4377-4395
Author(s):  
Jie Feng ◽  
Xuguang Wang ◽  
Jonathan Poterjoy

AbstractThe local particle filter (LPF) and the local nonlinear ensemble transform filter (LNETF) are two moment-matching nonlinear filters to approximate the classical particle filter (PF). They adopt different strategies to alleviate filter degeneracy. LPF and LNETF localize observational impact but use different localization functions. They assimilate observations in a partially sequential and a simultaneous manner, respectively. In addition, LPF applies the resampling step, whereas LNETF applies the deterministic square root transformation to update particles. Both methods preserve the posterior mean and variance of the PF. LNETF additionally preserves the posterior correlation of the PF for state variables within a local volume. These differences lead to their differing performance in filter stability and posterior moment estimation. LPF and LNETF are systematically compared and analyzed here through a set of experiments with a Lorenz model. Strategies to improve the LNETF are proposed. The original LNETF is inferior to the original LPF in filter stability and analysis accuracy, particularly for small particle numbers. This is attributed to both the localization function and particle update differences. The LNETF localization function imposes a stronger observation impact than the LPF for remote grids and thus is more susceptible to filter degeneracy. The LNETF update causes an overall narrower range of posteriors that excludes true states more frequently. After applying the same localization function as the LPF and additional posterior inflation to the LNETF, the two filters reach similar filter stability and analysis accuracy for all particle numbers. The improved LNETF shows more accurate posterior probability distribution but slightly worse spatial correlation of posteriors than the LPF.


Sign in / Sign up

Export Citation Format

Share Document