Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
From MaRDI portal
Publication:6087745
DOI10.1137/22m1502719zbMath1527.15001OpenAlexW4388705073MaRDI QIDQ6087745
Publication date: 16 November 2023
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m1502719
Numerical mathematical programming methods (65K05) Software, source code, etc. for problems pertaining to linear algebra (15-04) Numerical linear algebra (65F99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the arithmetic complexity of Strassen-like matrix multiplications
- Using Strassen's algorithm to accelerate the solution of linear systems
- Communication efficient matrix multiplication on hypercubes
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Matrix multiplication via arithmetic progressions
- Memory-efficient matrix multiplication in the BSP model
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- On practical algorithms for accelerated matrix multiplication
- On the implementation of Strassen's fast multiplication algorithm
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Improving and estimating the accuracy of Strassen's algorithm
- Communication lower bounds for distributed-memory matrix multiplication
- The I/O complexity of Strassen's matrix multiplication with recomputation
- Fast linear algebra is stable
- Gaussian elimination is not optimal
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- Improving the Numerical Stability of Fast Matrix Multiplication
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- The bilinear complexity and practical algorithms for matrix multiplication
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems
- Minimizing Communication in Numerical Linear Algebra
- Cache-Oblivious Algorithms
- Powers of tensors and fast matrix multiplication
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
- Extra High Speed Matrix Multiplication on the Cray-2
- LAPACK Users' Guide
- New Fast Algorithms for Matrix Operations
- On the Asymptotic Complexity of Matrix Multiplication
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On the Additive Complexity of Matrix Multiplication
- ScaLAPACK Users' Guide
- A set of level 3 basic linear algebra subprograms
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- Accuracy and Stability of Numerical Algorithms
- Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Strassen’s Algorithm Reloaded on GPUs
- Matrix Multiplication, a Little Faster
- Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication
- Graph expansion and communication costs of fast matrix multiplication
- Multiplying matrices faster than coppersmith-winograd
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
This page was built for publication: Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
