FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES

DOI10.1080/10637199408915454MaRDI QIDQ4820033zbMATH OpenOpenAlexFDO

Authors Jean-Louis Roch, B. 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)

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• Efficient Matrix Multiplication on SIMD Computers
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• Extra High Speed Matrix Multiplication on the Cray-2
• FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
• Gaussian elimination is not optimal
• How to multiply matrices faster
• On the implementation of Strassen's fast multiplication algorithm

Cited in

(1)

• FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES

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

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