Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
From MaRDI portal
Publication:6087745
Recommendations
- Matrix multiplication, a little faster
- A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels
- scientific article; zbMATH DE number 823632
- Anatomy of high-performance matrix multiplication
- Improving the numerical stability of fast matrix multiplication
Cites work
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A set of level 3 basic linear algebra subprograms
- Accuracy and Stability of Numerical Algorithms
- Cache-oblivious algorithms
- Communication efficient matrix multiplication on hypercubes
- Communication lower bounds for distributed-memory matrix multiplication
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation
- Extra High Speed Matrix Multiplication on the Cray-2
- Fast linear algebra is stable
- Gaussian elimination is not optimal
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Graph expansion analysis for communication costs of fast rectangular matrix multiplication
- Graph expansion and communication costs of fast matrix multiplication
- scientific article; zbMATH DE number 3534064 (Why is no real title available?)
- Improving and estimating the accuracy of Strassen's algorithm
- Improving the numerical stability of fast matrix multiplication
- LAPACK Users' Guide
- Matrix multiplication via arithmetic progressions
- Matrix multiplication, a little faster
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- Memory-efficient matrix multiplication in the BSP model
- Minimizing communication in numerical linear algebra
- Multiplying matrices faster than coppersmith-winograd
- New Fast Algorithms for Matrix Operations
- Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
- Numerical linear algebra
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On practical algorithms for accelerated matrix multiplication
- On the Additive Complexity of Matrix Multiplication
- On the arithmetic complexity of Strassen-like matrix multiplications
- On the Asymptotic Complexity of Matrix Multiplication
- On the implementation of Strassen's fast multiplication algorithm
- Powers of tensors and fast matrix multiplication
- Probabilistic tensors and opportunistic Boolean matrix multiplication
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- ScaLAPACK Users' Guide
- Strassen's algorithm reloaded on GPUs
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- The I/O complexity of Strassen's matrix multiplication with recomputation
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- Using Strassen's algorithm to accelerate the solution of linear systems
Cited in
(3)- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
- Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
- Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
This page was built for publication: Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087745)
