Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
From MaRDI portal
Publication:4998630
a posteriori error boundsapproximation classeshard and soft thresholdinghigh-dimensional diffusion equationslow-rank approximationnonlinear approximationparametric PDEstensor formats
Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Multidimensional problems (41A63) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Preconditioners for iterative methods (65F08) Numerical solutions to equations with linear operators (65J10) Error bounds for numerical methods for ordinary differential equations (65L70) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15)
Abstract: The challenge of mastering computational tasks of enormous size tends to frequently override questioning the quality of the numerical outcome in terms of accuracy. By this we do not mean the accuracy within the discrete setting, which itself may also be far from evident for ill-conditioned problems or when iterative solvers are involved. By accuracy-controlled computation we mean the deviation of the numerical approximation from the exact solution of an underlying continuous problem in a relevant metric, which has been the initiating interest in the first place. Can the accuracy of a numerical result be rigorously certified - a question that is particularly important in the context of uncertainty quantification, when many possible sources of uncertainties interact. This is the guiding question throughout this article, which reviews recent developments of low-rank approximation methods for problems in high spatial dimensions. In particular, we highlight the role of adaptivity when dealing with such strongly nonlinear methods that integrate in a natural way issues of discrete and continuous accuracy.
Recommendations
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
- Adaptive low-rank methods: problems on Sobolev spaces
- Adaptive low-rank methods for problems on Sobolev spaces with error control in \(\mathrm{L}_{2}\)
- A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
Cites work
- H-matrix approximation for the operator exponential with applications
- A literature survey of low-rank tensor approximation techniques
- A Multilinear Singular Value Decomposition
- A new scheme for the tensor representation
- A projection method to solve linear systems in tensor format
- A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- Adaptive low-rank methods for problems on Sobolev spaces with error control in \(\mathrm{L}_{2}\)
- Adaptive low-rank methods: problems on Sobolev spaces
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Adaptive stochastic Galerkin FEM with hierarchical tensor representations
- Adaptive wavelet algorithms for elliptic PDE's on product domains
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- Adaptive wavelet methods for elliptic partial differential equations with random operators
- Adaptive wavelet methods. II: Beyond the elliptic case
- Alternating minimal energy methods for linear systems in higher dimensions
- An adaptive stochastic Galerkin method for random elliptic operators
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Approximate iterations for structured matrices
- Approximation of 1/x by exponential sums in [1, ∞)
- Approximation of high-dimensional parametric PDEs
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Error bounds for approximations with deep ReLU networks
- Hierarchical Singular Value Decomposition of Tensors
- HT-AWGM: a hierarchical Tucker-adaptive wavelet Galerkin method for high-dimensional elliptic problems
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 1069611 (Why is no real title available?)
- Hyperbolic wavelet discretization of the two-electron Schrödinger equation in an explicitly correlated formulation
- Iterative methods based on soft thresholding of hierarchical tensors
- Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Multilevel preconditioning and low-rank tensor iteration for space-time simultaneous discretizations of parabolic PDEs
- Numerical operator calculus in higher dimensions
- On local convergence of alternating schemes for optimization of convex problems in the tensor train format
- On minimal subspaces in tensor representations
- On the efficient computation of high-dimensional integrals and the approximation by exponential sums
- Parametric PDEs: sparse or low-rank approximations?
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- Quantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs
- Representations of Gaussian random fields and approximation of elliptic PDEs with lognormal coefficients
- Singular value decomposition in Sobolev spaces. I
- Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
- Tensor Decompositions and Applications
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
Cited in
(6)- The adaption problem for approximating linear operators
- Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators
- Low-rank tensor methods for partial differential equations
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
- Accuracy controlled schemes for the eigenvalue problem of the radiative transfer equation
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
This page was built for publication: Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998630)
