Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
DOI10.1007/s10208-013-9187-3zbMath1335.65049arXiv1304.7796OpenAlexW3098901429MaRDI QIDQ896549
Wolfgang Dahmen, Markus Bachmayr
Publication date: 10 December 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7796
computational complexityconvergencenumerical examplesadaptive methodsiterative schemelow-rank tensor approximationhigh-dimensional operator equations
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)
Related Items (30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Solving stochastic systems with low-rank tensor compression
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- Approximation of functions of few variables in high dimensions
- Regularity of tensor product approximations to square integrable functions
- An adaptive wavelet method for solving high-dimensional elliptic PDEs
- Recursive decomposition of multidimensional tensors
- Approximate iterations for structured matrices
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
- Adaptive wavelet methods. II: Beyond the elliptic case
- On minimal subspaces in tensor representations
- Tree-based tensor formats
- A new scheme for the tensor representation
- Approximation of infinitely differentiable multivariate functions is intractable
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- Hyperbolic wavelet discretization of the two-electron Schrödinger equation in an explicitly correlated formulation
- A literature survey of low-rank tensor approximation techniques
- CONVERGENCE OF A GREEDY ALGORITHM FOR HIGH-DIMENSIONAL CONVEX NONLINEAR PROBLEMS
- Hierarchical Singular Value Decomposition of Tensors
- Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
- Tensor Spaces and Numerical Tensor Calculus
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A Class of Bases in $L^2$ for the Sparse Representation of Integral Operators
- A Multilinear Singular Value Decomposition
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- Numerical operator calculus in higher dimensions
- On the Compressibility of Operators in Wavelet Coordinates
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A projection method to solve linear systems in tensor format
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems
- Algorithms for Numerical Analysis in High Dimensions
This page was built for publication: Adaptive near-optimal rank tensor approximation for high-dimensional operator equations