Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
28/2012

Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats

Mike Espig, Wolfgang Hackbusch, Alexander Litvinenko, Hermann G. Matthies and Philipp Wähnert

Abstract

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 the smoothness of the covariance function and does not depend either on the number of random variables nor the degree of the multivariate Hermite polynomials.

Received:
May 16, 2012
Published:
May 24, 2012
MSC Codes:
65N30, 35R60, 60H15, 15A69
Keywords:
tensor approximation, stochastic PDEs, Galerkin matrix, Tensor formats

Related publications

inJournal
2014 Repository Open Access
Mike Espig, Wolfgang Hackbusch, Alexander Litvinenko, Hermann G. Matthies and Philipp Wähnert

Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats

In: Computers and mathematics with applications, 67 (2014) 4, pp. 818-829