Exploiting fast matrix multiplication within the level 3 BLAS
From MaRDI portal
Publication:4371658
error analysisFORTRAN 77 subprogramsmatrix multiplicationnumerical stabilityStrassen's algorithmtriangular systems
Recommendations
Cited in
(38)- Generalized matrix inversion is not harder than matrix multiplication
- Applications of level 2 BLAS in the NAG library
- Multilinear algebra and parallel programming
- Comparisons of Gaussian elimination algorithms on a Cray Y-MP
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Using Strassen's matrix multiplication in high performance solution of linear systems
- Fast rectangular matrix multiplication and QR decomposition
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
- Fast linear algebra is stable
- Fast matrix decomposition in F₂
- A practical algorithm for faster matrix multiplication
- Reliable generation of high-performance matrix algebra
- scientific article; zbMATH DE number 3974279 (Why is no real title available?)
- The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
- Stability of block LU factorization for block tridiagonal block H-matrices
- GEMM-based level 3 BLAS
- Algorithm 784: GEMM-based level 3 BLAS
- A parallel block implementation of Level-3 BLAS for MIMD vector processors
- Stability of block algorithms with fast level-3 BLAS
- scientific article; zbMATH DE number 1136274 (Why is no real title available?)
- Using Level 3 BLAS in Rotation-Based Algorithms
- Faster numerical algorithms via exception handling
- scientific article; zbMATH DE number 1526552 (Why is no real title available?)
- The RISC BLAS
- Algorithm 978: Safe scaling in the level 1 BLAS
- Fast matrix multiplication and its algebraic neighbourhood
- Backward stability analysis of weighted linear least-squares problems
- Accelerating BLAS and LAPACK via efficient floating point architecture design
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- Design, implementation and testing of extended and mixed precision BLAS
- Using Strassen's algorithm to accelerate the solution of linear systems
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Towards a modern LLL implementation
- Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
- How to grade the accuracy of the BLAS
- The complex step approximation to the Fréchet derivative of a matrix function
- Fast matrix multiplication is stable
This page was built for publication: Exploiting fast matrix multiplication within the level 3 BLAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371658)