FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES

DOI10.1080/10637199408915454zbMath1049.65536OpenAlexW1996487631MaRDI QIDQ4820033

Jean-Louis Roch, Bogdan Dumitrescu, Denis Trystram

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408915454

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES

Cites Work

• Unnamed Item
• How to multiply matrices faster
• On the implementation of Strassen's fast multiplication algorithm
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• Extra High Speed Matrix Multiplication on the Cray-2
• Efficient Matrix Multiplication on SIMD Computers
• FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES

This page was built for publication: FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES