hIPPYlib-MUQ: Scalable Markov chain Monte Carlo sampling methods for large-scale Bayesian inverse problems governed by PDEs
Ki-Tae Kim (University of California, Merced, 🇺🇸)
Umberto Villa (Washington University in St. Louis, 🇺🇸)
Matthew Parno (The United States Army Corps of Engineers, 🇺🇸)
Noemi Petra (University of California, Merced, 🇺🇸)
Youssef Marzouk (Massachusetts Institute of Technology, 🇺🇸)
Omar Ghattas (The University of Texas at Austin, 🇺🇸)
Tuesday session 2 (Zoom) (15:00–16:30 GMT)
You can cite this talk by using the following BibTeΧ:
@incollection{fenics2021-kim,
title = {hIPPYlib-MUQ: Scalable Markov chain Monte Carlo sampling methods for large-scale Bayesian inverse problems governed by PDEs},
author = {Ki-Tae Kim and Umberto Villa and Matthew Parno and Noemi Petra and Youssef Marzouk and Omar Ghattas},
year = {2021},
url = {http://mscroggs.github.io/fenics2021/talks/kim.html},
booktitle = {Proceedings of FEniCS 2021, online, 22--26 March},
editor = {Igor Baratta and J{\o}rgen S. Dokken and Chris Richarson and Matthew W. Scroggs},
doi = {10.6084/m9.figshare.14495274},
pages = {221}
}
Hide citation infoWith a massive explosion of datasets across all areas of science and engineering, the central questions are: How do we optimally learn from data through the lens of models? And how do we account for uncertainties in both data and models? These questions can be mathematically framed as Bayesian inverse problems. While powerful and sophisticated approaches have been developed to tackle these problems, such methods are often challenging to implement and there is no available software that easily facilitates the analysis of Bayesian inverse problems. In this talk, we present an extensible FEniCS-based software framework hIPPYlib-MUQ that overcomes these challenges by providing access to state-of-the-art algorithms that offer the capability to solve complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering areas.