Suscripción a Biblioteca: Guest
Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones
International Journal for Uncertainty Quantification
Factor de Impacto: 3.259 Factor de Impacto de 5 años: 2.547 SJR: 0.531 SNIP: 0.8 CiteScore™: 1.52

ISSN Imprimir: 2152-5080
ISSN En Línea: 2152-5099

Acceso abierto

International Journal for Uncertainty Quantification

DOI: 10.1615/Int.J.UncertaintyQuantification.2014007658
pages 349-364

OPTIMIZATION-BASED SAMPLING IN ENSEMBLE KALMAN FILTERING

Antti Solonen
Lappeenranta University of Technology, Laboratory of Applied Mathematics
Alexander Bibov
Lappeenranta University of Technology, Laboratory of Applied Mathematics
Johnathan M. Bardsley
Department of Mathematical Sciences, The University of Montana, Missoula, Montana 59812-0864, USA
Heikki Haario
Department of Mathematics and Physics, Lappeenranta University of Technology; Finnish Meteorological Institute, Helsinki, Finland

SINOPSIS

In the ensemble Kalman filter (EnKF), uncertainty in the state of a dynamical model is represented as samples of the state vector. The samples are propagated forward using the evolution model, and the forecast (prior) mean and covariance matrix are estimated from the ensemble. Data assimilation is carried out by using these estimates in the Kalman filter formulas. The prior is given in the subspace spanned by the propagated ensemble, the size of which is typically much smaller than the dimension of the state space. The rank-deficiency of these covariance matrices is problematic, and, for instance, unrealistic correlations often appear between spatially distant points, and different localization or covariance tapering methods are needed to make the approach feasible in practice. In this paper, we present a novel way to implement ensemble Kalman filtering using optimization-based sampling, in which the forecast error covariance has full rank and the need for localization is diminished. The method is based on the randomize then optimize (RTO) technique, where a sample from a Gaussian distribution is computed by perturbing the data and the prior, and solving a quadratic optimization problem. We test our method in two benchmark problems: the 40-dimensional Lorenz '96 model and the 1600-dimensional two-layer quasi-geostrophic model. Results show that the performance of the method is significantly better than that of the standard EnKF, especially with small ensemble sizes when the rank-deficiency problems in EnKF are emphasized.


Articles with similar content:

POLYNOMIAL-CHAOS-BASED KRIGING
International Journal for Uncertainty Quantification, Vol.5, 2015, issue 2
Joe Wiart, Bruno Sudret, Roland Schobi
AN ENSEMBLE KALMAN FILTER USING THE CONJUGATE GRADIENT SAMPLER
International Journal for Uncertainty Quantification, Vol.3, 2013, issue 4
Heikki Haario, Antti Solonen, Albert Parker, Marylesa Howard, Johnathan M. Bardsley
PROBABILITY MULTIVALUED LINGUISTIC NEUTROSOPHIC SETS FOR MULTI-CRITERIA GROUP DECISION-MAKING
International Journal for Uncertainty Quantification, Vol.7, 2017, issue 3
Nunu Wang, Hongyu Zhang
CLUSTERING-BASED COLLOCATION FOR UNCERTAINTY PROPAGATION WITH MULTIVARIATE DEPENDENT INPUTS
International Journal for Uncertainty Quantification, Vol.8, 2018, issue 1
D. T. Crommelin, Anne W. Eggels, J. A. S. Witteveen
POLYNOMIAL CHAOS FOR SEMIEXPLICIT DIFFERENTIAL ALGEBRAIC EQUATIONS OF INDEX 1
International Journal for Uncertainty Quantification, Vol.3, 2013, issue 1
Roland Pulch