1,919 research outputs found
Inverse problems and uncertainty quantification
In a Bayesian setting, inverse problems and uncertainty quantification (UQ) -
the propagation of uncertainty through a computational (forward) model - are
strongly connected. In the form of conditional expectation the Bayesian update
becomes computationally attractive. This is especially the case as together
with a functional or spectral approach for the forward UQ there is no need for
time-consuming and slowly convergent Monte Carlo sampling. The developed
sampling-free non-linear Bayesian update is derived from the variational
problem associated with conditional expectation. This formulation in general
calls for further discretisation to make the computation possible, and we
choose a polynomial approximation. After giving details on the actual
computation in the framework of functional or spectral approximations, we
demonstrate the workings of the algorithm on a number of examples of increasing
complexity. At last, we compare the linear and quadratic Bayesian update on the
small but taxing example of the chaotic Lorenz 84 model, where we experiment
with the influence of different observation or measurement operators on the
update.Comment: 25 pages, 17 figures. arXiv admin note: text overlap with
arXiv:1201.404
Sparse bayesian polynomial chaos approximations of elasto-plastic material models
In this paper we studied the uncertainty quantification in a functional approximation form of elastoplastic models parameterised by material uncertainties. The problem of estimating the polynomial chaos coefficients is recast in a linear regression form by taking into consideration the possible sparsity of the solution. Departing from the classical optimisation point of view, we take a slightly different path by solving the problem in a Bayesian manner with the help of new spectral based sparse Kalman filter algorithms
Parameter Estimation via Conditional Expectation --- A Bayesian Inversion
When a mathematical or computational model is used to analyse some system, it
is usual that some parameters resp.\ functions or fields in the model are not
known, and hence uncertain. These parametric quantities are then identified by
actual observations of the response of the real system. In a probabilistic
setting, Bayes's theory is the proper mathematical background for this
identification process. The possibility of being able to compute a conditional
expectation turns out to be crucial for this purpose. We show how this
theoretical background can be used in an actual numerical procedure, and
shortly discuss various numerical approximations
Bayesian parameter identification in plasticity
To evaluate the cyclic behaviour under different loading conditions using the kinematic and isotropic hardening theory of steel a Chaboche visco-plastic material model is employed. The parameters of a constitutive model are usually identified by minimization of the distance between model response and experimental data. However, measurement errors and differences in the specimens lead to deviations in the determined parameters. In this article the Choboche model is used and a stochastic simulation technique is applied to generate artificial data which exhibit the same stochastic behaviour as experimental data. Then the model parameters are identified by applying a variaty of Bayes’s theorem. Identified parameters are compared with the true parameters in the simulation and the efficiency of the identification method is discussed
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
- …