15,056 research outputs found
Polynomial Chaos Expansion of random coefficients and the solution of stochastic partial differential equations in the Tensor Train format
We apply the Tensor Train (TT) decomposition to construct the tensor product
Polynomial Chaos Expansion (PCE) of a random field, to solve the stochastic
elliptic diffusion PDE with the stochastic Galerkin discretization, and to
compute some quantities of interest (mean, variance, exceedance probabilities).
We assume that the random diffusion coefficient is given as a smooth
transformation of a Gaussian random field. In this case, the PCE is delivered
by a complicated formula, which lacks an analytic TT representation. To
construct its TT approximation numerically, we develop the new block TT cross
algorithm, a method that computes the whole TT decomposition from a few
evaluations of the PCE formula. The new method is conceptually similar to the
adaptive cross approximation in the TT format, but is more efficient when
several tensors must be stored in the same TT representation, which is the case
for the PCE. Besides, we demonstrate how to assemble the stochastic Galerkin
matrix and to compute the solution of the elliptic equation and its
post-processing, staying in the TT format.
We compare our technique with the traditional sparse polynomial chaos and the
Monte Carlo approaches. In the tensor product polynomial chaos, the polynomial
degree is bounded for each random variable independently. This provides higher
accuracy than the sparse polynomial set or the Monte Carlo method, but the
cardinality of the tensor product set grows exponentially with the number of
random variables. However, when the PCE coefficients are implicitly
approximated in the TT format, the computations with the full tensor product
polynomial set become possible. In the numerical experiments, we confirm that
the new methodology is competitive in a wide range of parameters, especially
where high accuracy and high polynomial degrees are required.Comment: This is a major revision of the manuscript arXiv:1406.2816 with
significantly extended numerical experiments. Some unused material is remove
A Hierarchical Spatio-Temporal Statistical Model Motivated by Glaciology
In this paper, we extend and analyze a Bayesian hierarchical spatio-temporal
model for physical systems. A novelty is to model the discrepancy between the
output of a computer simulator for a physical process and the actual process
values with a multivariate random walk. For computational efficiency, linear
algebra for bandwidth limited matrices is utilized, and first-order emulator
inference allows for the fast emulation of a numerical partial differential
equation (PDE) solver. A test scenario from a physical system motivated by
glaciology is used to examine the speed and accuracy of the computational
methods used, in addition to the viability of modeling assumptions. We conclude
by discussing how the model and associated methodology can be applied in other
physical contexts besides glaciology.Comment: Revision accepted for publication by the Journal of Agricultural,
Biological, and Environmental Statistic
Spatial Besov Regularity for Stochastic Partial Differential Equations on Lipschitz Domains
We use the scale of Besov spaces B^\alpha_{\tau,\tau}(O), \alpha>0,
1/\tau=\alpha/d+1/p, p fixed, to study the spatial regularity of the solutions
of linear parabolic stochastic partial differential equations on bounded
Lipschitz domains O\subset R^d. The Besov smoothness determines the order of
convergence that can be achieved by nonlinear approximation schemes. The proofs
are based on a combination of weighted Sobolev estimates and characterizations
of Besov spaces by wavelet expansions.Comment: 32 pages, 3 figure
- …