In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems from a stationary diffusion equation. The uncertain permeability coefficient is assumed to be a log-normal random field with given covariance and mean functions. The approximation is done in the canonical tensor format and then compared numerically with the tensor train and hierarchical tensor formats. It will be shown that under additional assumptions the approximation error depends only on smoothness of the covariance function and does not depend either on the number of random variables nor the degree of the multivariate Hermite polynomials
The discretization of the stationary diffusion equation with random parameters by the Stochastic Fin...
International audienceIn this paper, we propose a method for the approximation of the solution of hi...
Vol. xx, pp. x x–x Solving log-transformed random diffusion problems by stochastic Galerkin mixed fi...
Efficient low-rank approximation of the stochastic Galerkin matrix in tensor format
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
a b s t r a c t are the spatial coordinates, and y = (y 1 , . . . , y N ) 2 R N , N P 1, is a random...
The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems,...
Stochastic Galerkin methods for non-affine coefficient representations are known to cause major diff...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
Stochastic Galerkin finite element approximation of PDEs with random inputs leads to linear systems ...
International audienceTensor approximation methods are receiving a growing attention for their use i...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This pa...
The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems,...
summary:We introduce a new tool for obtaining efficient a posteriori estimates of errors of approxim...
The objective of this paper is to investigate a new numerical method for the approximation of the se...
The discretization of the stationary diffusion equation with random parameters by the Stochastic Fin...
International audienceIn this paper, we propose a method for the approximation of the solution of hi...
Vol. xx, pp. x x–x Solving log-transformed random diffusion problems by stochastic Galerkin mixed fi...
Efficient low-rank approximation of the stochastic Galerkin matrix in tensor format
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
a b s t r a c t are the spatial coordinates, and y = (y 1 , . . . , y N ) 2 R N , N P 1, is a random...
The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems,...
Stochastic Galerkin methods for non-affine coefficient representations are known to cause major diff...
In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of rando...
Stochastic Galerkin finite element approximation of PDEs with random inputs leads to linear systems ...
International audienceTensor approximation methods are receiving a growing attention for their use i...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This pa...
The solution of PDE with stochastic data commonly leads to very high-dimensional algebraic problems,...
summary:We introduce a new tool for obtaining efficient a posteriori estimates of errors of approxim...
The objective of this paper is to investigate a new numerical method for the approximation of the se...
The discretization of the stationary diffusion equation with random parameters by the Stochastic Fin...
International audienceIn this paper, we propose a method for the approximation of the solution of hi...
Vol. xx, pp. x x–x Solving log-transformed random diffusion problems by stochastic Galerkin mixed fi...