Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

DOI10.1137/22m1510443arXiv2207.10437WikidataQ128541178 ScholiaQ128541178MaRDI QIDQ6154935

Laura Grigori, Unnamed Author, Unnamed Author, Grey Ballard, Hussam al Daas

Publication date: 16 February 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithmstensor computationscommunication lower boundsHBL-inequalitiesmulti-TTM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Cites Work

• Tensor Decompositions and Applications
• Communication lower bounds for distributed-memory matrix multiplication
• Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities
• A Multilinear Singular Value Decomposition
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Low-Rank Tucker Approximation of a Tensor from Streaming Data
• TuckerMPI
• Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
• An inequality related to the isoperimetric inequality
• Accelerating alternating least squares for tensor decomposition by pairwise perturbation

This page was built for publication: Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation