How Can We Speed Up Matrix Multiplication?

DOI10.1137/1026076zbMath0563.65028OpenAlexW1967534352MaRDI QIDQ3677069

Pan, Victor Y.

Publication date: 1984

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1026076

zbMATH Keywords

recursive algorithmsbilinear algorithmsfast matrix multiplicationStrassen algorithmtrilinear versions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Fast rectangular matrix multiplication and QR decomposition, Schur aggregation for linear systems and determinants, Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Unnamed Item, Additive preconditioning and aggregation in matrix computations, Fast matrix multiplication and its algebraic neighbourhood, 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, On practical algorithms for accelerated matrix multiplication, Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions, Fast bilinear algorithms for symmetric tensor contractions, A polynomial method of approximate centers for linear programming, Optimization techniques for small matrix multiplication, Randomized preprocessing of homogeneous linear systems of equations, Normalized natural gradient in independent component analysis, Fast rectangular matrix multiplication and applications, Fast parallel algorithms for polynomial division over an arbitrary field of constants, Algorithms for fast convolutions on motion groups, A study on quaternion block quasi-tridiagonal systems