Parametric PDEs: sparse or low-rank approximations?

DOI10.1093/imanum/drx052zbMath1477.65189arXiv1607.04444OpenAlexW2515829451MaRDI QIDQ4555985

Wolfgang Dahmen, Markus Bachmayr, Albert Cohen

Publication date: 23 November 2018

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

adaptive methodscomplexity boundslow-rank approximations\textit{a posteriori} error estimatessparse polynomial expansionsparameter-dependent partial differential equations

Mathematics Subject Classification ID

Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (19)

Low-rank tensor reconstruction of concentrated densities with application to Bayesian inversion ⋮ An adaptive stochastic Galerkin method based on multilevel expansions of random fields: Convergence and optimality ⋮ Particle number conservation and block structures in matrix product states ⋮ Multilevel tensor approximation of PDEs with random data ⋮ Low-rank tensor methods for partial differential equations ⋮ Pricing High-Dimensional Bermudan Options with Hierarchical Tensor Formats ⋮ A low-rank solver for parameter estimation and uncertainty quantification in time-dependent systems of partial differential equations ⋮ Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting) ⋮ A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations ⋮ Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ Matrix Oriented Reduction of Space-Time Petrov-Galerkin Variational Problems ⋮ Numerical solution of the parametric diffusion equation by deep neural networks ⋮ Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations ⋮ A Hybrid Alternating Least Squares--TT-Cross Algorithm for Parametric PDEs ⋮ Non-intrusive tensor reconstruction for high-dimensional random PDEs ⋮ Adaptive low-rank approximations for operator equations: Accuracy control and computational complexity ⋮ The uniform sparse FFT with application to PDEs with random coefficients ⋮ Approximative Policy Iteration for Exit Time Feedback Control Problems Driven by Stochastic Differential Equations using Tensor Train Format ⋮ A theoretical analysis of deep neural networks and parametric PDEs

This page was built for publication: Parametric PDEs: sparse or low-rank approximations?