Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
From MaRDI portal
Publication:5157832
DOI10.1137/20M1338599zbMath1487.65051arXiv1707.04618MaRDI 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 chemistry; tensor contractions; tensors; bilinear algorithms; tensor symmetry; communication lower bounds
68Q25: Analysis of algorithms and problem complexity
65Y05: Parallel numerical computation
15A69: Multilinear algebra, tensor calculus
65F99: Numerical linear algebra
Related Items
Numerical algorithms for high-performance computational science, Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions, Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
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
