14,304 research outputs found
Measure transformation and efficient quadrature in reduced-dimensional stochastic modeling of coupled problems
Coupled problems with various combinations of multiple physics, scales, and
domains are found in numerous areas of science and engineering. A key challenge
in the formulation and implementation of corresponding coupled numerical models
is to facilitate the communication of information across physics, scale, and
domain interfaces, as well as between the iterations of solvers used for
response computations. In a probabilistic context, any information that is to
be communicated between subproblems or iterations should be characterized by an
appropriate probabilistic representation. Although the number of sources of
uncertainty can be expected to be large in most coupled problems, our
contention is that exchanged probabilistic information often resides in a
considerably lower dimensional space than the sources themselves. In this work,
we thus use a dimension-reduction technique for obtaining the representation of
the exchanged information. The main subject of this work is the investigation
of a measure-transformation technique that allows implementations to exploit
this dimension reduction to achieve computational gains. The effectiveness of
the proposed dimension-reduction and measure-transformation methodology is
demonstrated through a multiphysics problem relevant to nuclear engineering
A mixed regularization approach for sparse simultaneous approximation of parameterized PDEs
We present and analyze a novel sparse polynomial technique for the
simultaneous approximation of parameterized partial differential equations
(PDEs) with deterministic and stochastic inputs. Our approach treats the
numerical solution as a jointly sparse reconstruction problem through the
reformulation of the standard basis pursuit denoising, where the set of jointly
sparse vectors is infinite. To achieve global reconstruction of sparse
solutions to parameterized elliptic PDEs over both physical and parametric
domains, we combine the standard measurement scheme developed for compressed
sensing in the context of bounded orthonormal systems with a novel mixed-norm
based regularization method that exploits both energy and sparsity. In
addition, we are able to prove that, with minimal sample complexity, error
estimates comparable to the best -term and quasi-optimal approximations are
achievable, while requiring only a priori bounds on polynomial truncation error
with respect to the energy norm. Finally, we perform extensive numerical
experiments on several high-dimensional parameterized elliptic PDE models to
demonstrate the superior recovery properties of the proposed approach.Comment: 23 pages, 4 figure
A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions
In this work we develop a dynamically adaptive sparse grids (SG) method for
quasi-optimal interpolation of multidimensional analytic functions defined over
a product of one dimensional bounded domains. The goal of such approach is to
construct an interpolant in space that corresponds to the "best -terms"
based on sharp a priori estimate of polynomial coefficients. In the past, SG
methods have been successful in achieving this, with a traditional construction
that relies on the solution to a Knapsack problem: only the most profitable
hierarchical surpluses are added to the SG. However, this approach requires
additional sharp estimates related to the size of the analytic region and the
norm of the interpolation operator, i.e., the Lebesgue constant. Instead, we
present an iterative SG procedure that adaptively refines an estimate of the
region and accounts for the effects of the Lebesgue constant. Our approach does
not require any a priori knowledge of the analyticity or operator norm, is
easily generalized to both affine and non-affine analytic functions, and can be
applied to sparse grids build from one dimensional rules with arbitrary growth
of the number of nodes. In several numerical examples, we utilize our
dynamically adaptive SG to interpolate quantities of interest related to the
solutions of parametrized elliptic and hyperbolic PDEs, and compare the
performance of our quasi-optimal interpolant to several alternative SG schemes
- …