Nonlinear Model Reduction for Uncertainty Quantification in Large-Scale Inverse Problems
We present a model reduction approach to the solution of large-scale statistical inverse problems in a Bayesian inference setting. A key to the model reduction is an efficient representation of the non-linear terms in the reduced model. To achieve this, we present a formulation that employs masked p...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
John Wiley & Sons, Inc.,
2011-03-17T12:04:42Z.
|
Subjects: | |
Online Access: | Get fulltext |
Summary: | We present a model reduction approach to the solution of large-scale statistical inverse problems in a Bayesian inference setting. A key to the model reduction is an efficient representation of the non-linear terms in the reduced model. To achieve this, we present a formulation that employs masked projection of the discrete equations; that is, we compute an approximation of the non-linear term using a select subset of interpolation points. Further, through this formulation we show similarities among the existing techniques of gappy proper orthogonal decomposition, missing point estimation, and empirical interpolation via coefficient-function approximation. The resulting model reduction methodology is applied to a highly non-linear combustion problem governed by an advection-diffusion-reaction partial differential equation (PDE). Our reduced model is used as a surrogate for a finite element discretization of the non-linear PDE within the Markov chain Monte Carlo sampling employed by the Bayesian inference approach. In two spatial dimensions, we show that this approach yields accurate results while reducing the computational cost by several orders of magnitude. For the full three-dimensional problem, a forward solve using a reduced model that has high fidelity over the input parameter space is more than two million times faster than the full-order finite element model, making tractable the solution of the statistical inverse problem that would otherwise require many years of CPU time. MIT-Singapore Alliance. Computational Engineering Programme United States. Air Force Office of Scientific Research (Contract Nos. FA9550-06-0271) National Science Foundation (U.S.) (Grant No. CNS-0540186) National Science Foundation (U.S.) (Grant No. CNS-0540372) Caja Madrid Foundation (Graduate Fellowship) |
---|