Multilevel tensor approximation of PDEs with random data

From MaRDI portal
Publication:1685682

DOI10.1007/S40072-017-0092-7zbMATH Open1383.65006arXiv1606.05505OpenAlexW2963953645MaRDI QIDQ1685682FDOQ1685682

Michael Peters, Daniel Kressner, Jonas Ballani

Publication date: 19 December 2017

Published in: Stochastic and Partial Differential Equations. Analysis and Computations (Search for Journal in Brave)

Abstract: In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parameter-dependent problem on a high-dimensional parameter domain. Given a hierarchy of finite element discretizations for the spatial approximation, we make use of a multilevel framework in which we consider the differences of the solution on two consecutive finite element levels in the collocation points. We then address the approximation of these high-dimensional differences by adaptive low-rank tensor techniques. This allows to equilibrate the error on all levels by exploiting analytic and algebraic properties of the solution at the same time. We arrive at an explicit representation in a low-rank tensor format of the approximate solution on the entire parameter domain, which can be used for, e.g., the direct and cheap computation of statistics. Numerical results are provided in order to illustrate the approach.


Full work available at URL: https://arxiv.org/abs/1606.05505




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Multilevel tensor approximation of PDEs with random data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685682)