Faster tensor train decomposition for sparse data

DOI10.1016/j.cam.2021.113972zbMath1480.65109arXiv1908.02721OpenAlexW4206022883WikidataQ114201931 ScholiaQ114201931MaRDI QIDQ2068649

Kim Batselier, Lingjie Li, Wen-Jian Yu

Publication date: 20 January 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.02721

zbMATH Keywords

sparse datatensor train decompositionparallel-vector roundingTT-rounding

Mathematics Subject Classification ID

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

Related Items (1)

Parallel Algorithms for Tensor Train Arithmetic

Uses Software

• SLEPc
• SNAP
• xerus

Cites Work

• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
• A theory of pseudoskeleton approximations
• Tensor network alternating linear scheme for MIMO Volterra system identification
• Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
• SLEPc
• Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
• Tensor Train Neighborhood Preserving Embedding
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• Corrected One-Site Density Matrix Renormalization Group and Alternating Minimal Energy Algorithm

This page was built for publication: Faster tensor train decomposition for sparse data