Iterative ensemble smoother as an approximate solution to a regularized minimum-average-cost problem: theory and applications
arXiv:1505.01135 · doi:10.2118/176023-PA
Abstract
The focus of this work is on an alternative implementation of the iterative ensemble smoother (iES). We show that iteration formulae similar to those used in \cite{chen2013-levenberg,emerick2012ensemble} can be derived by adopting a regularized Levenberg-Marquardt (RLM) algorithm \cite{jin2010regularized} to approximately solve a minimum-average-cost (MAC) problem. This not only leads to an alternative theoretical tool in understanding and analyzing the behaviour of the aforementioned iES, but also provides insights and guidelines for further developments of the smoothing algorithms. For illustration, we compare the performance of an implementation of the RLM-MAC algorithm to that of the approximate iES used in \cite{chen2013-levenberg} in three numerical examples: an initial condition estimation problem in a strongly nonlinear system, a facies estimation problem in a 2D reservoir and the history matching problem in the Brugge field case. In these three specific cases, the RLM-MAC algorithm exhibits comparable or even better performance, especially in the strongly nonlinear system.
Some insights on iterative ensemble smoother (iES) from the point of view of stochastic programming and potential for further iES algorithm developments
Cited by in corpus (8)
- Towards a Robust Parameterization for Conditioning Facies Models Using Deep Variational Autoencoders and Ensemble Smoother
- Ensemble Kalman method for learning turbulence models from indirect observation data
- Deep generative models in inversion: a review and development of a new approach based on a variational autoencoder
- Data-Space Inversion with Ensemble Smoother
- Ensemble-based kernel learning for a class of data assimilation problems with imperfect forward simulators
- Analysis of Geometric Selection of the Data-Error Covariance Inflation for ES-MDA
- Combining direct and indirect sparse data for learning generalizable turbulence models
- A wall model for separated flows: embedded learning to improve a posteriori performance