 NSFPAR ID:
 10275714
 Date Published:
 Journal Name:
 The Cryosphere
 Volume:
 15
 Issue:
 4
 ISSN:
 19940424
 Page Range / eLocation ID:
 1731 to 1750
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract The replacement of a nonlinear parametertoobservable mapping with a linear (affine) approximation is often carried out to reduce the computational costs associated with solving largescale inverse problems governed by partial differential equations (PDEs). In the case of a linear parametertoobservable mapping with normally distributed additive noise and a Gaussian prior measure on the parameters, the posterior is Gaussian. However, substituting an accurate model for a (possibly well justified) linear surrogate model can give misleading results if the induced model approximation error is not accounted for. To account for the errors, the Bayesian approximation error (BAE) approach can be utilised, in which the first and second order statistics of the errors are computed via sampling. The most common linear approximation is carried out via linear Taylor expansion, which requires the computation of (Fréchet) derivatives of the parametertoobservable mapping with respect to the parameters of interest. In this paper, we prove that the (approximate) posterior measure obtained by replacing the nonlinear parametertoobservable mapping with a linear approximation is in fact independent of the choice of the linear approximation when the BAE approach is employed. Thus, somewhat nonintuitively, employing the zeromodel as the linear approximation gives the same approximate posterior as any other choice of linear approximations of the parametertoobservable model. The independence of the linear approximation is demonstrated mathematically and illustrated with two numerical PDEbased problems: an inverse scattering type problem and an inverse conductivity type problem.more » « less

Abstract Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical largescale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at largescale. These tasks can be reduced to loglinear complexity by utilizing hierarchical offdiagonal lowrank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. We demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton datamisfit Hessian is more efficiently approximated by the HODLR matrix format than the lowrank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for largescale problems by studying the datamisfit Hessian associated with inverse problems governed by the firstorder Stokes flow model on the Humboldt glacier and Greenland ice sheet.more » « less

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with blackbox Markov chain Monte Carlo (MCMC) methods. We present hIPPYlibMUQ, an extensible and scalable software framework that contains implementations of stateofthe art algorithms aimed to overcome the challenges of highdimensional, PDEconstrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic lowdimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary opensource software packages, hIPPYlib and MUQ. hIPPYlib solves PDEconstrained inverse problems using automaticallygenerated adjointbased derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit largescale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex largescale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlibMUQ, we present a comparison of a number of MCMC methods available in the integrated software on several highdimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (∼ 50×) speedups over conventional black box and gradientbased MCMC algorithms can be obtained by exploiting Hessian information (from the logposterior), underscoring the power of the integrated hIPPYlibMUQ framework.more » « less

We investigate solution methods for largescale inverse problems governed by partial differential equations (PDEs) via Bayesian inference. The Bayesian framework provides a statistical setting to infer uncertain parameters from noisy measurements. To quantify posterior uncertainty, we adopt Markov Chain Monte Carlo (MCMC) approaches for generating samples. To increase the efficiency of these approaches in highdimension, we make use of local information about gradient and Hessian of the target potential, also via Hamiltonian Monte Carlo (HMC). Our target application is inferring the field of soil permeability processing observations of pore pressure, using a nonlinear PDE poromechanics model for predicting pressure from permeability. We compare the performance of different sampling approaches in this and other settings. We also investigate the effect of dimensionality and nongaussianity of distributions on the performance of different sampling methods.

null (Ed.)We present an extensible software framework, hIPPYlib, for solution of largescale deterministic and Bayesian inverse problems governed by partial differential equations (PDEs) with (possibly) infinitedimensional parameter fields (which are highdimensional after discretization). hIPPYlib overcomes the prohibitively expensive nature of Bayesian inversion for this class of problems by implementing stateoftheart scalable algorithms for PDEbased inverse problems that exploit the structure of the underlying operators, notably the Hessian of the logposterior. The key property of the algorithms implemented in hIPPYlib is that the solution of the inverse problem is computed at a cost, measured in linearized forward PDE solves, that is independent of the parameter dimension. The mean of the posterior is approximated by the MAP point, which is found by minimizing the negative logposterior with an inexact matrixfree NewtonCG method. The posterior covariance is approximated by the inverse of the Hessian of the negative log posterior evaluated at the MAP point. The construction of the posterior covariance is made tractable by invoking a lowrank approximation of the Hessian of the loglikelihood. Scalable tools for sample generation are also discussed. hIPPYlib makes all of these advanced algorithms easily accessible to domain scientists and provides an environment that expedites the development of new algorithms.more » « less