24,008 research outputs found
Stochastic collocation on unstructured multivariate meshes
Collocation has become a standard tool for approximation of parameterized
systems in the uncertainty quantification (UQ) community. Techniques for
least-squares regularization, compressive sampling recovery, and interpolatory
reconstruction are becoming standard tools used in a variety of applications.
Selection of a collocation mesh is frequently a challenge, but methods that
construct geometrically "unstructured" collocation meshes have shown great
potential due to attractive theoretical properties and direct, simple
generation and implementation. We investigate properties of these meshes,
presenting stability and accuracy results that can be used as guides for
generating stochastic collocation grids in multiple dimensions.Comment: 29 pages, 6 figure
Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
We analyze the convergence of compressive sensing based sampling techniques
for the efficient evaluation of functionals of solutions for a class of
high-dimensional, affine-parametric, linear operator equations which depend on
possibly infinitely many parameters. The proposed algorithms are based on
so-called "non-intrusive" sampling of the high-dimensional parameter space,
reminiscent of Monte-Carlo sampling. In contrast to Monte-Carlo, however, a
functional of the parametric solution is then computed via compressive sensing
methods from samples of functionals of the solution. A key ingredient in our
analysis of independent interest consists in a generalization of recent results
on the approximate sparsity of generalized polynomial chaos representations
(gpc) of the parametric solution families, in terms of the gpc series with
respect to tensorized Chebyshev polynomials. In particular, we establish
sufficient conditions on the parametric inputs to the parametric operator
equation such that the Chebyshev coefficients of the gpc expansion are
contained in certain weighted -spaces for . Based on this we
show that reconstructions of the parametric solutions computed from the sampled
problems converge, with high probability, at the , resp.
convergence rates afforded by best -term approximations of the parametric
solution up to logarithmic factors.Comment: revised version, 27 page
Level Set Methods for Stochastic Discontinuity Detection in Nonlinear Problems
Stochastic physical problems governed by nonlinear conservation laws are
challenging due to solution discontinuities in stochastic and physical space.
In this paper, we present a level set method to track discontinuities in
stochastic space by solving a Hamilton-Jacobi equation. By introducing a speed
function that vanishes at discontinuities, the iso-zero of the level set
problem coincide with the discontinuities of the conservation law. The level
set problem is solved on a sequence of successively finer grids in stochastic
space. The method is adaptive in the sense that costly evaluations of the
conservation law of interest are only performed in the vicinity of the
discontinuities during the refinement stage. In regions of stochastic space
where the solution is smooth, a surrogate method replaces expensive evaluations
of the conservation law. The proposed method is tested in conjunction with
different sets of localized orthogonal basis functions on simplex elements, as
well as frames based on piecewise polynomials conforming to the level set
function. The performance of the proposed method is compared to existing
adaptive multi-element generalized polynomial chaos methods
- …