Implementing high-performance complex matrix multiplication via the 1M method
From MaRDI portal
Recommendations
- Anatomy of high-performance matrix multiplication
- Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
- A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels
- scientific article; zbMATH DE number 1728263
- Fast algorithms for complex matrix multiplication using surrogates
Cites work
- A set of level 3 basic linear algebra subprograms
- Analytical modeling is enough for high-performance BLIS
- Anatomy of high-performance matrix multiplication
- Automated empirical optimizations of software and the ATLAS project
- BLASFEO: Basic linear algebra subroutines for embedded optimization
- BLIS: a framework for rapidly instantiating BLAS functionality
- scientific article; zbMATH DE number 1728263 (Why is no real title available?)
- Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
- Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
- Strassen's Algorithm for Tensor Contraction
Cited in
(3)
This page was built for publication: Implementing high-performance complex matrix multiplication via the 1M method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131971)