On practical algorithms for accelerated matrix multiplication

DOI10.1016/0024-3795(92)90393-OzbMath0748.65043OpenAlexW1995169979MaRDI QIDQ1183208

Xuan-He Sha, Julian Laderman, Pan, Victor Y.

Publication date: 28 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90393-o

zbMATH Keywords

finite fieldsNumerical experimentsbilinear algorithmsmatrix multiplicationStrassen's algorithmbilinear complexityacceleration of computation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Related Items

Efficient transitive closure of sparse matrices over closed semirings, Fast rectangular matrix multiplication and QR decomposition, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, Randomized preprocessing versus pivoting, Additive preconditioning and aggregation in matrix computations, Fast matrix multiplication and its algebraic neighbourhood, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Solving structured linear systems with large displacement rank, Parametrization of Newton's iteration for computations with structured matrices and applications, Optimization techniques for small matrix multiplication, Randomized preprocessing of homogeneous linear systems of equations, Improving the Numerical Stability of Fast Matrix Multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to multiply matrices faster
• Stability of fast algorithms for matrix multiplication
• New combinations of methods for the acceleration of matrix multiplication
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• How Can We Speed Up Matrix Multiplication?
• Extra High Speed Matrix Multiplication on the Cray-2