Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
DOI10.1137/20M1338599zbMath1487.65051arXiv1707.04618OpenAlexW3199939468MaRDI QIDQ5157832
T. Hoefler, Edgar Solomonik, James W. Demmel
Publication date: 20 October 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.04618
quantum chemistrytensor contractionstensorsbilinear algorithmstensor symmetrycommunication lower bounds
Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Related Items (3)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Towards an efficient use of the BLAS library for multilinear tensor contractions
- The bulk-synchronous parallel random access machine
- Communication lower bounds for distributed-memory matrix multiplication
- The I/O complexity of Strassen's matrix multiplication with recomputation
- The Brascamp-Lieb inequalities: Finiteness, structure and extremals
- Gaussian elimination is not optimal
- Minimizing Communication in Numerical Linear Algebra
- How Can We Speed Up Matrix Multiplication?
- Basic Linear Algebra Subprograms for Fortran Usage
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
- Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
- Symmetric Tensors and Symmetric Tensor Rank
- Graph expansion and communication costs of fast matrix multiplication
- An inequality related to the isoperimetric inequality
This page was built for publication: Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
