8 research outputs found
Domain-decomposed Bayesian inversion based on local Karhunen-Lo\`{e}ve expansions
In many Bayesian inverse problems the goal is to recover a spatially varying
random field. Such problems are often computationally challenging especially
when the forward model is governed by complex partial differential equations
(PDEs). The challenge is particularly severe when the spatial domain is large
and the unknown random field needs to be represented by a high-dimensional
parameter. In this paper, we present a domain-decomposed method to attack the
dimensionality issue and the method decomposes the spatial domain and the
parameter domain simultaneously. On each subdomain, a local Karhunen-Lo`eve
(KL) expansion is constructed, and a local inversion problem is solved
independently in a parallel manner, and more importantly, in a
lower-dimensional space. After local posterior samples are generated through
conducting Markov chain Monte Carlo (MCMC) simulations on subdomains, a novel
projection procedure is developed to effectively reconstruct the global field.
In addition, the domain decomposition interface conditions are dealt with an
adaptive Gaussian process-based fitting strategy. Numerical examples are
provided to demonstrate the performance of the proposed method
Domain-decomposed Bayesian inversion based on local Karhunen-Loève expansions
In many Bayesian inverse problems the goal is to recover a spatially varying random field. Such problems are often computationally challenging especially when the forward model is governed by complex partial differential equations (PDEs). The challenge is particularly severe when the spatial domain is large and the unknown random field needs to be represented by a high-dimensional parameter. In this paper, we present a domain-decomposed method to attack the dimensionality issue and the method decomposes the spatial domain and the parameter domain simultaneously. On each subdomain, a local Karhunen-Loève (KL) expansion is constructed, and a local inversion problem is solved independently in a parallel manner, and more importantly, in a lower-dimensional space. After local posterior samples are generated through conducting Markov chain Monte Carlo (MCMC) simulations on subdomains, a novel projection procedure is developed to effectively reconstruct the global field. In addition, the domain decomposition interface conditions are dealt with an adaptive Gaussian process-based fitting strategy. Numerical examples are provided to demonstrate the performance of the proposed method
A Domain Decomposition Approach for Uncertainty Analysis
This paper proposes a decomposition approach for uncertainty analysis of systems governed by partial differential equations (PDEs). The system is split into local components using domain decomposition. Our domain-decomposed uncertainty quantification (DDUQ) approach performs uncertainty analysis independently on each local component in an “offline" phase, and then assembles global uncertainty analysis results using precomputed local information in an “online" phase. At the heart of the DDUQ approach is importance sampling, which weights the precomputed local PDE solutions appropriately so as to satisfy the domain decomposition coupling conditions. To avoid global PDE solves in the online phase, a proper orthogonal decomposition reduced model provides an efficient approximate representation of the coupling functions.United States. Air Force Office of Scientific Research (Grant FA9550-12-1-0420
A Domain Decomposition Approach for Uncertainty Analysis
This paper proposes a decomposition approach for uncertainty analysis of systems governed by partial differential equations (PDEs). The system is split into local components using domain decomposition. Our domain-decomposed uncertainty quantification (DDUQ) approach performs uncertainty analysis independently on each local component in an “offline" phase, and then assembles global uncertainty analysis results using precomputed local information in an “online" phase. At the heart of the DDUQ approach is importance sampling, which weights the precomputed local PDE solutions appropriately so as to satisfy the domain decomposition coupling conditions. To avoid global PDE solves in the online phase, a proper orthogonal decomposition reduced model provides an efficient approximate representation of the coupling functions.United States. Air Force Office of Scientific Research (Grant FA9550-12-1-0420