Adaptive hierarchical subtensor partitioning for tensor compression

DOI10.1137/19M128689XMaRDI QIDQ5147989zbMATH OpenFDO

Authors Laura Grigori, Damiano Lombardi, Hao Song, Virginie Ehrlacher

Publication date 29 January 2021

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19M128689X

zbMATH Keywords

compressionCP and Tucker formatsHOSVDtensors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Multiresolution low-rank tensor formats
• Tensor train construction from tensor actions, with application to compression of large high order derivative tensors
• SOTT: greedy approximation of a tensor as a sum of tensor trains
• Tree adaptive approximation in the hierarchical tensor format
• Higher-Order QR with Tournament Pivoting for Tensor Compression

Cites work

• A continuous analogue of the tensor-train decomposition
• A dynamical adaptive tensor method for the Vlasov-Poisson system
• A literature survey of low-rank tensor approximation techniques
• A Multilinear Singular Value Decomposition
• APPROXIMATION AND ENTROPY NUMBERS OF SOBOLEV EMBEDDINGS OVER DOMAINS WITH FINITE MEASURE
• Hierarchical matrices: algorithms and analysis
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
• scientific article; zbMATH DE number 6876834 (Why is no real title available?)
• Low-rank tensor Krylov subspace methods for parametrized linear systems
• 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
• Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
• Structured data-sparse approximation to high order tensors arising from the deterministic Boltzmann equation
• Tensor Decompositions and Applications
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
• Tensor spaces and numerical tensor calculus
• Tensor-product approximation to operators and functions in high dimensions
• Tensor-train decomposition

Cited in

(9)

• TuckerMPI: a parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition
• Multiresolution low-rank tensor formats
• Tensor train construction from tensor actions, with application to compression of large high order derivative tensors
• Higher-Order QR with Tournament Pivoting for Tensor Compression
• Parallel Algorithms for Computing the Tensor-Train Decomposition
• RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors
• Algorithm 1036: ATC, an advanced Tucker compression library for multidimensional data
• Efficient randomized algorithms for computing an approximation of the tensor train decomposition
• Efficient randomized algorithms for fixed precision problem of approximate Tucker decomposition

This page was built for publication: Adaptive hierarchical subtensor partitioning for tensor compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147989)