Gaussian process regression and conditional Karhunen-Loève models for data assimilation in inverse problems

DOI10.1016/J.JCP.2024.112788arXiv2301.11279OpenAlexW4391152174MaRDI QIDQ6129869FDOQ6129869

Authors: Yu-Hong Yeung, David A. Barajas-Solano, Alexandre M. Tartakovsky 

Publication date: 17 April 2024

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: We present a model inversion algorithm, CKLEMAP, for data assimilation and parameter estimation in partial differential equation models of physical systems with spatially heterogeneous parameter fields. These fields are approximated using low-dimensional conditional Karhunen-Lo'{e}ve expansions, which are constructed using Gaussian process regression models of these fields trained on the parameters' measurements. We then assimilate measurements of the state of the system and compute the maximum a posteriori estimate of the CKLE coefficients by solving a nonlinear least-squares problem. When solving this optimization problem, we efficiently compute the Jacobian of the vector objective by exploiting the sparsity structure of the linear system of equations associated with the forward solution of the physics problem. The CKLEMAP method provides better scalability compared to the standard MAP method. In the MAP method, the number of unknowns to be estimated is equal to the number of elements in the numerical forward model. On the other hand, in CKLEMAP, the number of unknowns (CKLE coefficients) is controlled by the smoothness of the parameter field and the number of measurements, and is in general much smaller than the number of discretization nodes, which leads to a significant reduction of computational cost with respect to the standard MAP method. To show its advantage in scalability, we apply CKLEMAP to estimate the transmissivity field in a two-dimensional steady-state subsurface flow model of the Hanford Site by assimilating synthetic measurements of transmissivity and hydraulic head. We find that the execution time of CKLEMAP scales nearly linearly as $N^{1.33}$, where $N$ is the number of discretization nodes, while the execution time of standard MAP scales as $N^{2.91}$. The CKLEMAP method improved execution time without sacrificing accuracy when compared to the standard MAP.

Full work available at URL: https://arxiv.org/abs/2301.11279

Recommendations

• Conditional Karhunen-Loève regression model with basis adaptation for high-dimensional problems: uncertainty quantification and inverse modeling
• Gaussian process regression and conditional polynomial chaos for parameter estimation
• Ensemble Kalman methods for inverse problems
• Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction
• Iterated Kalman methodology for inverse problems

zbMATH Keywords

Gaussian process regressionmodel inversionmaximum a posteriori (MAP)conditional Karhunen-Loève expansion

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Probabilistic methods, stochastic differential equations (65Cxx) Miscellaneous topics in calculus of variations and optimal control (49Nxx)

Cited In (1)

• Conditional Karhunen-Loève regression model with basis adaptation for high-dimensional problems: uncertainty quantification and inverse modeling

This page was built for publication: Gaussian process regression and conditional Karhunen-Loève models for data assimilation in inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129869)