584 research outputs found
Uncertainty Quantification of geochemical and mechanical compaction in layered sedimentary basins
In this work we propose an Uncertainty Quantification methodology for
sedimentary basins evolution under mechanical and geochemical compaction
processes, which we model as a coupled, time-dependent, non-linear,
monodimensional (depth-only) system of PDEs with uncertain parameters. While in
previous works (Formaggia et al. 2013, Porta et al., 2014) we assumed a
simplified depositional history with only one material, in this work we
consider multi-layered basins, in which each layer is characterized by a
different material, and hence by different properties. This setting requires
several improvements with respect to our earlier works, both concerning the
deterministic solver and the stochastic discretization. On the deterministic
side, we replace the previous fixed-point iterative solver with a more
efficient Newton solver at each step of the time-discretization. On the
stochastic side, the multi-layered structure gives rise to discontinuities in
the dependence of the state variables on the uncertain parameters, that need an
appropriate treatment for surrogate modeling techniques, such as sparse grids,
to be effective. We propose an innovative methodology to this end which relies
on a change of coordinate system to align the discontinuities of the target
function within the random parameter space. The reference coordinate system is
built upon exploiting physical features of the problem at hand. We employ the
locations of material interfaces, which display a smooth dependence on the
random parameters and are therefore amenable to sparse grid polynomial
approximations. We showcase the capabilities of our numerical methodologies
through two synthetic test cases. In particular, we show that our methodology
reproduces with high accuracy multi-modal probability density functions
displayed by target state variables (e.g., porosity).Comment: 25 pages, 30 figure
IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains
This paper proposes an extension of the Multi-Index Stochastic Collocation
(MISC) method for forward uncertainty quantification (UQ) problems in
computational domains of shape other than a square or cube, by exploiting
isogeometric analysis (IGA) techniques. Introducing IGA solvers to the MISC
algorithm is very natural since they are tensor-based PDE solvers, which are
precisely what is required by the MISC machinery. Moreover, the
combination-technique formulation of MISC allows the straight-forward reuse of
existing implementations of IGA solvers. We present numerical results to
showcase the effectiveness of the proposed approach.Comment: version 3, version after revisio
An adaptive minimum spanning tree multi-element method for uncertainty quantification of smooth and discontinuous responses
A novel approach for non-intrusive uncertainty propagation is proposed. Our
approach overcomes the limitation of many traditional methods, such as
generalised polynomial chaos methods, which may lack sufficient accuracy when
the quantity of interest depends discontinuously on the input parameters. As a
remedy we propose an adaptive sampling algorithm based on minimum spanning
trees combined with a domain decomposition method based on support vector
machines. The minimum spanning tree determines new sample locations based on
both the probability density of the input parameters and the gradient in the
quantity of interest. The support vector machine efficiently decomposes the
random space in multiple elements, avoiding the appearance of Gibbs phenomena
near discontinuities. On each element, local approximations are constructed by
means of least orthogonal interpolation, in order to produce stable
interpolation on the unstructured sample set. The resulting minimum spanning
tree multi-element method does not require initial knowledge of the behaviour
of the quantity of interest and automatically detects whether discontinuities
are present. We present several numerical examples that demonstrate accuracy,
efficiency and generality of the method.Comment: 20 pages, 18 figure
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
Efficient Localization of Discontinuities in Complex Computational Simulations
Surrogate models for computational simulations are input-output
approximations that allow computationally intensive analyses, such as
uncertainty propagation and inference, to be performed efficiently. When a
simulation output does not depend smoothly on its inputs, the error and
convergence rate of many approximation methods deteriorate substantially. This
paper details a method for efficiently localizing discontinuities in the input
parameter domain, so that the model output can be approximated as a piecewise
smooth function. The approach comprises an initialization phase, which uses
polynomial annihilation to assign function values to different regions and thus
seed an automated labeling procedure, followed by a refinement phase that
adaptively updates a kernel support vector machine representation of the
separating surface via active learning. The overall approach avoids structured
grids and exploits any available simplicity in the geometry of the separating
surface, thus reducing the number of model evaluations required to localize the
discontinuity. The method is illustrated on examples of up to eleven
dimensions, including algebraic models and ODE/PDE systems, and demonstrates
improved scaling and efficiency over other discontinuity localization
approaches
An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
A novel approach for nonintrusive uncertainty propagation is proposed. Our approach
overcomes the limitation of many traditional methods, such as generalized polynomial chaos
methods, which may lack sufficient accuracy when the quantity of interest depends discontinuously
on the input parameters. As a remedy we propose an adaptive sampling algorithm based on minimum
spanning trees combined with a domain d
- …