hIPPYlib: An Extensible Software Framework for Large-Scale Inverse Problems Governed by PDEs: Part I: Deterministic Inversion and Linearized Bayesian Inference

被引:51
作者
Villa, Umberto [1 ]
Petra, Noemi [2 ]
Ghattas, Omar [3 ]
机构
[1] Washington Univ, Elect & Syst Engn, St Louis, MO 63110 USA
[2] Univ Calif Merced, Appl Math, Sch Nat Sci, Merced, CA USA
[3] Univ Texas Austin, Oden Inst Computat Engn & Sci, Dept Mech Engn, Dept Geol Sci, Austin, TX 78712 USA
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2021年 / 47卷 / 02期
基金
美国国家科学基金会;
关键词
Infinite-dimensional inverse problems; adjoint-based methods; inexact Newton-CG method; low-rank approximation; Bayesian inference; uncertainty quantification; sampling; generic PDE toolkit; STOCHASTIC NEWTON MCMC; A-OPTIMAL DESIGN; ALGORITHMS; UNCERTAINTY; PARALLEL; ADJOINT; FLOW;
D O I
10.1145/3428447
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present an extensible software framework, hIPPYlib, for solution of large-scale deterministic and Bayesian inverse problems governed by partial differential equations (PDEs) with (possibly) infinite-dimensional parameter fields (which are high-dimensional after discretization). hIPPYlib overcomes the prohibitively expensive nature of Bayesian inversion for this class of problems by implementing state-of-the-art scalable algorithms for PDE-based inverse problems that exploit the structure of the underlying operators, notably the Hessian of the log-posterior. 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 theMAP point, which is found by minimizing the negative log-posterior with an inexact matrix-free Newton-CG 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 low-rank approximation of the Hessian of the log-likelihood. 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.
引用
收藏
页数:34
相关论文
共 77 条
  • [1] Parallel algorithms for PDE-constrained optimization
    Akcelik, Volkan
    Biros, George
    Ghattas, Omar
    Hill, Judith
    Keyes, David
    Waanders, Bart van Bloemen
    [J]. PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING, 2006, : 291 - 322
  • [2] A FAST AND SCALABLE METHOD FOR A-OPTIMAL DESIGN OF EXPERIMENTS FOR INFINITE-DIMENSIONAL BAYESIAN NONLINEAR INVERSE PROBLEMS
    Alexanderian, Alen
    Petra, Noemi
    Stadler, Georg
    Ghattas, Omar
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (01) : A243 - A272
  • [3] A-OPTIMAL DESIGN OF EXPERIMENTS FOR INFINITE-DIMENSIONAL BAYESIAN LINEAR INVERSE PROBLEMS WITH REGULARIZED l0-SPARSIFICATION
    Alexanderian, Alen
    Petra, Noemi
    Stadler, Georg
    Ghattas, Omar
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2014, 36 (05) : A2122 - A2148
  • [4] Alnas M.S., 2012, Automated Solution of Differential Equations by the Finite Element Method, P273, DOI DOI 10.1007/978-3-642-23099-8_5
  • [5] [Anonymous], 2014, PETSc
  • [6] [Anonymous], 2012, COMPUTATIONAL OPTIMI
  • [7] [Anonymous], 2000, APPROXIMATING INTEGR
  • [8] [Anonymous], 2003, SUBJECTIVE OBJECTIVE
  • [9] [Anonymous], 1977, Solution of Ill-Posed Problems
  • [10] [Anonymous], 2002, COMPUTATIONAL METHOD