How Can We Speed Up Matrix Multiplication?

DOI10.1137/1026076MaRDI QIDQ3677069zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bilinear algorithmsfast matrix multiplicationrecursive algorithmsStrassen algorithmtrilinear versions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4088834
• scientific article; zbMATH DE number 495873
• Matrix multiplication via arithmetic progressions
• Fast matrix multiplication and its algebraic neighbourhood
• Fast rectangular matrix multiplication and applications

Cited in

(27)

• Extra High Speed Matrix Multiplication on the Cray-2
• Optimization techniques for small matrix multiplication
• Derivation and analysis of fast bilinear algorithms for convolution
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• On practical algorithms for accelerated matrix multiplication
• Normalized natural gradient in independent component analysis
• A practical algorithm for faster matrix multiplication
• Schur aggregation for linear systems and determinants
• Fast bilinear algorithms for symmetric tensor contractions
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
• Algorithms for fast convolutions on motion groups
• Randomized preprocessing of homogeneous linear systems of equations
• Matrix compression by common subexpression elimination
• A study on quaternion block quasi-tridiagonal systems
• Fast rectangular matrix multiplication and QR decomposition
• Veni, Divisi, Vici
• Fast rectangular matrix multiplication and applications
• scientific article; zbMATH DE number 495873 (Why is no real title available?)
• scientific article; zbMATH DE number 4088834 (Why is no real title available?)
• Finding complex-valued solutions of brent equations using nonlinear least squares
• Additive preconditioning and aggregation in matrix computations
• Fast rectangular matrix multiplication and some applications
• Fast matrix multiplication and its algebraic neighbourhood
• Communication lower bounds of bilinear algorithms for symmetric tensor contractions
• Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
• Fast parallel algorithms for polynomial division over an arbitrary field of constants
• A polynomial method of approximate centers for linear programming

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)