29 pages, 11 figures, 1 algorithm. Accepted by the Journal of Computational Physics. The computer code can be downloaded from https://github.com/GaukharSH/mienkf
In this work we combine ideas from multi-index Monte Carlo and
ensemble Kalman filtering (EnKF) to produce a highly efficient
filtering method called multi-index EnKF (MIEnKF). MIEnKF is based
on independent samples of four-coupled EnKF estimators on a
multi-index hierarchy of resolution levels, and it may be viewed as
an extension of the multilevel EnKF (MLEnKF) method developed by the
same authors in 2020. Multi-index here refers to a two-index method,
consisting of a hierarchy of EnKF estimators that are coupled in two
degrees of freedom: time discretization and ensemble size. Under
certain assumptions, when strong coupling between solutions on
neighboring numerical resolutions is attainable, the MIEnKF method
is proven to be more tractable than EnKF and MLEnKF. Said efficiency
gains are also verified numerically in a series of test problems.
We introduce a new multilevel ensemble Kalman filter method (MLEnKF) which consists of a hierarchy of independent samples of ensemble Kalman filters (EnKF). This new MLEnKF method is fundamentally different from the preexisting method introduced by Hoel, Law and Tempone in 2016, and it is suitable for extensions towards multi-index Monte Carlo based filtering methods. Robust theoretical analysis and supporting numerical examples show that under appropriate regularity assumptions, the MLEnKF method has better complexity than plain vanilla EnKF in the large-ensemble and fine-resolution limits, f…
Ensemble Kalman inversion is a parallelizable derivative-free method to solve inverse problems. The method uses an ensemble that follows the Kalman update formula iteratively to solve an optimization problem. The ensemble size is crucial to capture the correct statistical information in estimating the unknown variable of interest. Still, the ensemble is limited to a size smaller than the unknown variable's dimension for computational efficiency. This study proposes a strategy to correct the sampling error due to a small ensemble size, which improves the performance of the ensemble Kalman inver…
Multilevel ensemble Kalman filtering for spatially extended models
Carl von Ossietzky University Oldenburg(奥尔登堡卡尔·冯·奥西茨基大学);University of Oslo(奥斯陆大学);Oak Ridge National Laboratory(橡树岭国家实验室);École polytechnique fédérale de Lausanne(洛桑联邦理工学院);KAUST(阿卜杜拉国王科技大学)
We design and analyse the performance of a multilevel ensemble Kalman filter method (MLEnKF) for filtering settings where the underlying state-space model is an infinite-dimensional spatio-temporal process. We consider underlying models that needs to be simulated by numerical methods, with discretization in both space and time. The multilevel Monte Carlo (MLMC) sampling strategy, achieving variance reduction through pairwise coupling of ensemble particles on neighboring resolutions, is used in the sample-moment step of MLEnKF to produce an efficient hierarchical filtering method for spatio-tem…
The spatial dependent unknown acoustic source is reconstructed according noisy multiple frequency data on a remote closed surface. Assume that the unknown function is supported on a bounded domain. To determine the support, we present a statistical inversion algorithm, which combines the ensemble Kalman filter approach with level set technique. Several numerical examples show that the proposed method give good numerical reconstruction.
Concurrent observation technologies have made high-precision real-time data available in large quantities. Data assimilation (DA) is concerned with how to combine this data with physical models to produce accurate predictions. For spatial-temporal models, the Ensemble Kalman Filter with proper localization techniques is considered to be a state-of-the-art DA methodology. This article proposes and investigates a localized Ensemble Kalman Bucy Filter (l-EnKBF) for nonlinear models with short-range interactions. We derive dimension-independent and component-wise error bounds and show the long tim…
This paper provides a unified perspective of iterative ensemble Kalman methods, a family of derivative-free algorithms for parameter reconstruction and other related tasks. We identify, compare and develop three subfamilies of ensemble methods that differ in the objective they seek to minimize and the derivative-based optimization scheme they approximate through the ensemble. Our work emphasizes two principles for the derivation and analysis of iterative ensemble Kalman methods: statistical linearization and continuum limits. Following these guiding principles, we introduce new iterative ensem…
Inverse problems are more challenging when only partial data are available in general. In this paper, we propose a two-step approach combining the extended sampling method and the ensemble Kalman filter to reconstruct an elastic rigid obstacle using partial data. In the first step, the approximate location of the unknown obstacle is obtained by the extended sampling method. In the second step, the ensemble Kalman filter is employed to reconstruct the shape. The location obtained in the first step guides the construction of the initial particles of the ensemble Kalman filter, which is critical …
Ensemble Kalman inversion (EKI) is a derivative-free optimization method that lies between the deterministic and the probabilistic approaches for inverse problems. EKI iterates the Kalman update of ensemble-based Kalman filters, whose ensemble converges to a minimizer of an objective function. EKI regularizes ill-posed problems by restricting the ensemble to the linear span of the initial ensemble, or by iterating regularization with early stopping. Another regularization approach for EKI, Tikhonov EKI, penalizes the objective function using the $l_2$ penalty term, preventing overfitting in th…
This paper uses a probabilistic approach to analyze the converge of an ensemble Kalman filter solution to an exact Kalman filter solution in the simplest possible setting, the scalar case, as it allows us to build upon a rich literature of scalar probability distributions and non-elementary functions. To this end we introduce the bare-bones Scalar Pedagogical Ensemble Kalman Filter (SPEnKF). We show that in the asymptotic case of ensemble size, the expected value of both the analysis mean and variance estimate of the SPEnKF converges to that of the true Kalman filter, and that the variances of…
The Ensemble Kalman Filter method can be used as an iterative particle numerical scheme for state dynamics estimation and control--to--observable identification problems. In applications it may be required to enforce the solution to satisfy equality constraints on the control space. In this work we deal with this problem from a constrained optimization point of view, deriving corresponding optimality conditions. Continuous limits, in time and in the number of particles, allows us to study properties of the method. We illustrate the performance of the method by using test inverse problems from …
This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods for nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the r…