Adaptive Hierarchical Subtensor Partitioning for Tensor Compression
From MaRDI portal
Publication:5147989
DOI10.1137/19M128689XzbMath1466.65034MaRDI QIDQ5147989
Damiano Lombardi, Hao Song, Laura Grigori, Virginie Ehrlacher
Publication date: 29 January 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (1)
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A dynamical adaptive tensor method for the Vlasov-Poisson system
- Semi-classical limit of the Levy-Lieb functional in density functional theory
- Smoothing of transport plans with fixed marginals and rigorous semiclassical limit of the Hohenberg-Kohn functional
- A continuous analogue of the tensor-train decomposition
- Tensor-product approximation to operators and functions in high dimensions
- A literature survey of low-rank tensor approximation techniques
- Hierarchical Matrices: Algorithms and Analysis
- Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
- Tensor Spaces and Numerical Tensor Calculus
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Structured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation
- Hierarchical Tensor Approximation of Output Quantities of Parameter-Dependent PDEs
- APPROXIMATION AND ENTROPY NUMBERS OF SOBOLEV EMBEDDINGS OVER DOMAINS WITH FINITE MEASURE
- A Multilinear Singular Value Decomposition
This page was built for publication: Adaptive Hierarchical Subtensor Partitioning for Tensor Compression
