Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
From MaRDI portal
(Redirected from Publication:896549)
Abstract: We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous convergence analysis, where all parameters required for the execution of the methods depend only on the underlying infinite-dimensional problem, but not on a concrete discretization. Under certain assumptions on the rates for the involved low-rank approximations and basis expansions, we can also give bounds on the computational complexity of the iteration as a function of the prescribed target error. Our theoretical findings are illustrated and supported by computational experiments. These demonstrate that problems in very high dimensions can be treated with controlled solution accuracy.
Recommendations
- Adaptive low-rank methods: problems on Sobolev spaces
- HT-AWGM: a hierarchical Tucker-adaptive wavelet Galerkin method for high-dimensional elliptic problems
- On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
- A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
Cites work
- A Class of Bases in L² for the Sparse Representation of Integral Operators
- 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
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- Adaptive wavelet methods. II: Beyond the elliptic case
- Algorithms for Numerical Analysis in High Dimensions
- An adaptive wavelet method for solving high-dimensional elliptic PDEs
- Approximate iterations for structured matrices
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- Approximation of functions of few variables in high dimensions
- Approximation of infinitely differentiable multivariate functions is intractable
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Convergence of a greedy algorithm for high-dimensional convex nonlinear problems
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 1069611 (Why is no real title available?)
- scientific article; zbMATH DE number 2001584 (Why is no real title available?)
- Hyperbolic wavelet discretization of the two-electron Schrödinger equation in an explicitly correlated formulation
- Numerical operator calculus in higher dimensions
- On minimal subspaces in tensor representations
- On the Compressibility of Operators in Wavelet Coordinates
- Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- Recursive decomposition of multidimensional tensors
- Regularity of tensor product approximations to square integrable functions
- Solving stochastic systems with low-rank tensor compression
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor-train decomposition
- Tree-based tensor formats
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
Cited in
(40)- Quantized tensor-structured finite elements for second-order elliptic PDEs in two dimensions
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- Modified iterations for data-sparse solution of linear systems
- Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs
- HT-AWGM: a hierarchical Tucker-adaptive wavelet Galerkin method for high-dimensional elliptic problems
- On the approximation of electronic wavefunctions by anisotropic Gauss and Gauss-Hermite functions
- Iterative methods based on soft thresholding of hierarchical tensors
- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- Analysis of tensor approximation schemes for continuous functions
- 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 tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Fast solvers for partial differential equations. Abstracts from the workshop held May 11--16, 2014.
- Existence of dynamical low-rank approximations to parabolic problems
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- On the interconnection between the higher-order singular values of real tensors
- Efficient resolution of anisotropic structures
- A Review on Adaptive Low-Rank Approximation Techniques in the Hierarchical Tensor Format
- Valuation of structured financial products by adaptive multiwavelet methods in high dimensions
- Adaptive Smolyak Pseudospectral Approximations
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- A posteriori error analysis and adaptivity for high-dimensional elliptic and parabolic boundary value problems
- Low-rank tensor methods for partial differential equations
- Approximation theory of tree tensor networks: tensorized univariate functions
- A space-time adaptive low-rank method for high-dimensional parabolic partial differential equations
- An iterative method for the solution of Laplace-like equations in high and very high space dimensions
- Tensorized block rational Krylov methods for tensor Sylvester equations
- APTT: accuracy-preserved tensor-train method for the Boltzmann-BGK equation
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
- Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
- Iterative thresholding low-rank time integration for high-dimensional problems
- Iterative algorithms for the post-processing of high-dimensional data
- On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
This page was built for publication: Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896549)
