Implementing High-Performance Complex Matrix Multiplication via the 1M Method
From MaRDI portal
Publication:5131971
DOI10.1137/19M1282040zbMath1452.65087OpenAlexW3084619881MaRDI QIDQ5131971
Publication date: 9 November 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1282040
Numerical linear algebra (65F99) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical algorithms for computer arithmetic, etc. (65Y04)
Uses Software
Cites Work
- Unnamed Item
- BLIS: A Framework for Rapidly Instantiating BLAS Functionality
- Anatomy of high-performance matrix multiplication
- Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
- A set of level 3 basic linear algebra subprograms
- Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
- BLASFEO
- Analytical Modeling Is Enough for High-Performance BLIS
- Strassen's Algorithm for Tensor Contraction
- Automated empirical optimizations of software and the ATLAS project
This page was built for publication: Implementing High-Performance Complex Matrix Multiplication via the 1M Method