Non-intrusive tensor reconstruction for high-dimensional random PDEs

DOI10.1515/cmam-2018-0028zbMath1419.35259OpenAlexW2884465099WikidataQ114053156 ScholiaQ114053156MaRDI QIDQ2324350

Martin Eigel, Johannes Neumann, Sebastian Wolf, Reinhold Schneider

Publication date: 11 September 2019

Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/cmam-2018-0028

zbMATH Keywords

uncertainty quantificationtensor representationlow-rankpartial differential equations with random coefficientstensor trainnon-intrusivetensor reconstruction

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solutions to equations with linear operators (65J10) PDEs with randomness, stochastic partial differential equations (35R60) Random linear operators (47B80) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

Low-rank tensor reconstruction of concentrated densities with application to Bayesian inversion ⋮ Adaptive Nonintrusive Reconstruction of Solutions to High-Dimensional Parametric PDEs ⋮ An Adaptive Stochastic Galerkin Tensor Train Discretization for Randomly Perturbed Domains ⋮ Neural network-based variational methods for solving quadratic porous medium equations in high dimensions ⋮ Two-Level a Posteriori Error Estimation for Adaptive Multilevel Stochastic Galerkin Finite Element Method ⋮ Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations ⋮ Editorial. Tensor numerical methods: actual theory and recent applications

Uses Software

• ALEA
• xerus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• Computation of extreme eigenvalues in higher dimensions using block tensor train format
• Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
• Low-rank tensor completion by Riemannian optimization
• Adaptive stochastic Galerkin FEM
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
• Iterative algorithms for the post-processing of high-dimensional data
• Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation
• Black box approximation of tensors in hierarchical Tucker format
• A new scheme for the tensor representation
• Stable als approximation in the TT-format for rank-adaptive tensor completion
• Adaptive stochastic Galerkin FEM with hierarchical tensor representations
• Low rank tensor recovery via iterative hard thresholding
• On manifolds of tensors of fixed TT-rank
• Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs
• An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
• Karhunen-Loève approximation of random fields by generalized fast multipole methods
• A literature survey of low-rank tensor approximation techniques
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• An Introduction to Computational Stochastic PDEs
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
• Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
• Tensor Spaces and Numerical Tensor Calculus
• Parametric and Uncertainty Computations with Tensor Product Representations
• Local Equilibration Error Estimators for Guaranteed Error Control in Adaptive Stochastic Higher-Order Galerkin Finite Element Methods
• Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
• A convergent adaptive stochastic Galerkin finite element method with quasi-optimal spatial meshes
• Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Parametric PDEs: sparse or low-rank approximations?
• Stochastic finite element methods for partial differential equations with random input data
• A Hybrid Alternating Least Squares--TT-Cross Algorithm for Parametric PDEs
• Time Integration of Tensor Trains
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data