Strassen's Algorithm for Tensor Contraction
From MaRDI portal
Publication:5745128
DOI10.1137/17M1135578zbMath1416.65117arXiv1704.03092MaRDI QIDQ5745128
Devin A. Matthews, Jianyu Huang, Robert A. van de Geijn
Publication date: 5 June 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.03092
Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69)
Related Items
Implementing High-Performance Complex Matrix Multiplication via the 1M Method, Fast bilinear algorithms for symmetric tensor contractions
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Towards an efficient use of the BLAS library for multilinear tensor contractions
- Fast matrix multiplication is stable
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Gaussian elimination is not optimal
- Improving the Numerical Stability of Fast Matrix Multiplication
- BLIS: A Framework for Rapidly Instantiating BLAS Functionality
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems
- Anatomy of high-performance matrix multiplication
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A set of level 3 basic linear algebra subprograms
- TTC
- Design of a High-Performance GEMM-like Tensor–Tensor Multiplication
- High-Performance Tensor Contraction without Transposition
- Accuracy and Stability of Numerical Algorithms
- Matrix Multiplication, a Little Faster
- Analytical Modeling Is Enough for High-Performance BLIS
- Symmetric Tensors and Symmetric Tensor Rank
- Design, implementation and testing of extended and mixed precision BLAS
