Design of a High-Performance GEMM-like Tensor–Tensor Multiplication
From MaRDI portal
Publication:4581393
DOI10.1145/3157733zbMath1484.65092arXiv1607.00145OpenAlexW2963137752WikidataQ113310097 ScholiaQ113310097MaRDI QIDQ4581393
Paul Springer, Paolo Bientinesi
Publication date: 17 August 2018
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00145
high-performance computingtensor contractionsmatrix-matrix multiplicationdomain-specific code generator
Vector and tensor algebra, theory of invariants (15A72) Parallel numerical computation (65Y05) Numerical linear algebra (65F99)
Related Items (9)
Multidimensional Array Data Management ⋮ TSFC: A Structure-Preserving Form Compiler ⋮ Architecture-based and target-oriented algorithm optimization of high-order methods via complete-search tensor contraction ⋮ High-Performance Tensor Contraction without Transposition ⋮ A \(\mu\)-mode BLAS approach for multidimensional tensor-structured problems ⋮ Deneb: an open-source high-performance multi-physical flow solver based on high-order DRM-DG method ⋮ Strassen's Algorithm for Tensor Contraction ⋮ Direct reconstruction method for discontinuous Galerkin methods on higher-order mixed-curved meshes III. Code optimization via tensor contraction ⋮ Efficient high-order spectral element discretizations for building block operators of CFD
Uses Software
This page was built for publication: Design of a High-Performance GEMM-like Tensor–Tensor Multiplication