How Can We Speed Up Matrix Multiplication?
From MaRDI portal
Publication:3677069
DOI10.1137/1026076zbMATH Open0563.65028OpenAlexW1967534352MaRDI QIDQ3677069FDOQ3677069
Authors: Victor Y. Pan 
Publication date: 1984
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1026076
Recommendations
bilinear algorithmsfast matrix multiplicationrecursive algorithmsStrassen algorithmtrilinear versions
Cited In (27)
- Fast rectangular matrix multiplication and applications
- Schur aggregation for linear systems and determinants
- Additive preconditioning and aggregation in matrix computations
- Fast rectangular matrix multiplication and QR decomposition
- A polynomial method of approximate centers for linear programming
- Fast matrix multiplication and its algebraic neighbourhood
- On practical algorithms for accelerated matrix multiplication
- Normalized natural gradient in independent component analysis
- Algorithms for fast convolutions on motion groups
- Title not available (Why is that?)
- Fast bilinear algorithms for symmetric tensor contractions
- Veni, Divisi, Vici
- Extra High Speed Matrix Multiplication on the Cray-2
- Fast rectangular matrix multiplication and some applications
- Derivation and analysis of fast bilinear algorithms for convolution
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Title not available (Why is that?)
- Finding complex-valued solutions of brent equations using nonlinear least squares
- Matrix compression by common subexpression elimination
- Communication lower bounds of bilinear algorithms for symmetric tensor contractions
- Randomized preprocessing of homogeneous linear systems of equations
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Optimization techniques for small matrix multiplication
- A practical algorithm for faster matrix multiplication
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
- A study on quaternion block quasi-tridiagonal systems
This page was built for publication: How Can We Speed Up Matrix Multiplication?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677069)
