Parametric PDEs: sparse or low-rank approximations?
From MaRDI portal
(Redirected from Publication:4555985)
\textit{a posteriori} error estimatesadaptive methodscomplexity boundslow-rank approximationsparameter-dependent partial differential equationssparse polynomial expansions
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) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75)
Abstract: We consider adaptive approximations of the parameter-to-solution map for elliptic operator equations depending on a large or infinite number of parameters, comparing approximation strategies of different degrees of nonlinearity: sparse polynomial expansions, general low-rank approximations separating spatial and parametric variables, and hierarchical tensor decompositions separating all variables. We describe corresponding adaptive algorithms based on a common generic template and show their near-optimality with respect to natural approximability assumptions for each type of approximation. A central ingredient in the resulting bounds for the total computational complexity are new operator compression results for the case of infinitely many parameters. We conclude with a comparison of the complexity estimates based on the actual approximability properties of classes of parametric model problems, which shows that the computational costs of optimized low-rank expansions can be significantly lower or higher than those of sparse polynomial expansions, depending on the particular type of parametric problem.
Recommendations
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- To be or not to be intrusive? The solution of parametric and stochastic equations -- proper generalized decomposition
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Multilevel approximation of parametric and stochastic PDES
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
Cited in
(37)- Multilevel tensor approximation of PDEs with random data
- Numerical solution of the parametric diffusion equation by deep neural networks
- The uniform sparse FFT with application to PDEs with random coefficients
- A theoretical analysis of deep neural networks and parametric PDEs
- Low-rank tensor reconstruction of concentrated densities with application to Bayesian inversion
- Particle number conservation and block structures in matrix product states
- Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations
- Non-intrusive tensor reconstruction for high-dimensional random PDEs
- Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting)
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Sparse tensor approximation of parametric eigenvalue problems
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Multilevel approximation of parametric and stochastic PDES
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
- An adaptive stochastic Galerkin method based on multilevel expansions of random fields: convergence and optimality
- Matrix oriented reduction of space-time Petrov-Galerkin variational problems
- A hybrid alternating least squares-TT-cross algorithm for parametric PDEs
- Weakly Intrusive Low-Rank Approximation Method for Nonlinear Parameter-Dependent Equations
- A preconditioned low-rank projection method with a rank-reduction scheme for stochastic partial differential equations
- Approximative policy iteration for exit time feedback control problems driven by stochastic differential equations using tensor train format
- 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
- A local hybrid surrogate-based finite element tearing interconnecting dual-primal method for nonsmooth random partial differential equations
- One-shot learning of surrogates in PDE-constrained optimization under uncertainty
- Approximating the stationary Bellman equation by hierarchical tensor products
- The reduced basis method in space and time: challenges, limits and perspectives
- A convergent adaptive finite element stochastic Galerkin method based on multilevel expansions of random fields
- Multilevel representations of random fields and sparse approximations of solutions to random PDEs
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
- A certified wavelet-based physics-informed neural network for the solution of parameterized partial differential equations
- Application of dimension truncation error analysis to high-dimensional function approximation in uncertainty quantification
- A subspace method based on the Neumann series for the solution of parametric linear systems
- A unified framework for multiscale spectral generalized FEMs and low-rank approximations to multiscale PDEs
This page was built for publication: Parametric PDEs: sparse or low-rank approximations?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555985)
