15 research outputs found
Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit
We show the potential of greedy recovery strategies for the sparse
approximation of multivariate functions from a small dataset of pointwise
evaluations by considering an extension of the orthogonal matching pursuit to
the setting of weighted sparsity. The proposed recovery strategy is based on a
formal derivation of the greedy index selection rule. Numerical experiments
show that the proposed weighted orthogonal matching pursuit algorithm is able
to reach accuracy levels similar to those of weighted minimization
programs while considerably improving the computational efficiency for small
values of the sparsity level
Sparse Deterministic Approximation of Bayesian Inverse Problems
We present a parametric deterministic formulation of Bayesian inverse
problems with input parameter from infinite dimensional, separable Banach
spaces. In this formulation, the forward problems are parametric, deterministic
elliptic partial differential equations, and the inverse problem is to
determine the unknown, parametric deterministic coefficients from noisy
observations comprising linear functionals of the solution.
We prove a generalized polynomial chaos representation of the posterior
density with respect to the prior measure, given noisy observational data. We
analyze the sparsity of the posterior density in terms of the summability of
the input data's coefficient sequence. To this end, we estimate the
fluctuations in the prior. We exhibit sufficient conditions on the prior model
in order for approximations of the posterior density to converge at a given
algebraic rate, in terms of the number of unknowns appearing in the
parameteric representation of the prior measure. Similar sparsity and
approximation results are also exhibited for the solution and covariance of the
elliptic partial differential equation under the posterior. These results then
form the basis for efficient uncertainty quantification, in the presence of
data with noise
A Dimension-Adaptive Multi-Index Monte Carlo Method Applied to a Model of a Heat Exchanger
We present an adaptive version of the Multi-Index Monte Carlo method,
introduced by Haji-Ali, Nobile and Tempone (2016), for simulating PDEs with
coefficients that are random fields. A classical technique for sampling from
these random fields is the Karhunen-Lo\`eve expansion. Our adaptive algorithm
is based on the adaptive algorithm used in sparse grid cubature as introduced
by Gerstner and Griebel (2003), and automatically chooses the number of terms
needed in this expansion, as well as the required spatial discretizations of
the PDE model. We apply the method to a simplified model of a heat exchanger
with random insulator material, where the stochastic characteristics are
modeled as a lognormal random field, and we show consistent computational
savings