A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications

DOI10.1016/0020-0190(78)90063-7zbMath0379.65022OpenAlexW1968368735WikidataQ114215573 ScholiaQ114215573MaRDI QIDQ1247162

Gabriel Schachtel

Publication date: 1978

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90063-7

Mathematics Subject Classification ID

Related Items (2)

Optimization techniques for small matrix multiplication ⋮ A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications

Cites Work

• Unnamed Item
• Unnamed Item
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• On Obtaining Upper Bounds on the Complexity of Matrix Multiplication

This page was built for publication: A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications