High-Performance Tensor Contraction without Transposition

DOI10.1137/16M108968XzbMath1379.65024arXiv1607.00291OpenAlexW2588061952MaRDI QIDQ4600011

Devin A. Matthews

Publication date: 5 January 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

performancehigh-performance computingmultilinear algebramatrix multiplicationtensor contractiontensor-to-matrix transformation

Mathematics Subject Classification ID

Related Items (2)

A \(\mu\)-mode BLAS approach for multidimensional tensor-structured problems ⋮ Strassen's Algorithm for Tensor Contraction

Uses Software

• Blitz++
• BLAS
• Blitz++ library
• Eigen
• NumPy
• Algorithm 862
• BLIS
• TTC
• AUGEM

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Towards an efficient use of the BLAS library for multilinear tensor contractions
• BLIS: A Framework for Rapidly Instantiating BLAS Functionality
• Algorithm 862
• Anatomy of high-performance matrix multiplication
• An extended set of FORTRAN basic linear algebra subprograms
• Basic Linear Algebra Subprograms for Fortran Usage
• A set of level 3 basic linear algebra subprograms
• TTC
• Design of a High-Performance GEMM-like Tensor–Tensor Multiplication
• Applied Multiway Data Analysis

This page was built for publication: High-Performance Tensor Contraction without Transposition