Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

DOI10.1145/1576702.1576713MaRDI QIDQ2883800zbMATH OpenOpenAlexFDO

Authors Brice Boyer, Clément Pernet, Wei Zhou

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.1361

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Matrix multiplication, a little faster
• Adaptive Winograd's matrix multiplications
• GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
• Efficient Matrix Multiplication on SIMD Computers
• A practical algorithm for faster matrix multiplication

Cited in

(8)

• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• On the arithmetic complexity of Strassen-like matrix multiplications
• Constructing memory-minimizing schedules for multifrontal methods
• Fast matrix multiplication and its algebraic neighbourhood
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
• In-place fast polynomial modular remainder
• In-place accumulation of fast multiplication formulae
• Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)

Describes a project that uses

Uses Software

• GEMMW

This page was built for publication: Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883800)