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

DOI10.1016/0020-0190(78)90063-7MaRDI QIDQ1247162zbMATH OpenOpenAlexWikidataFDO

Authors 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

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 3551895 (Why is no real title available?)
• scientific article; zbMATH DE number 3446412 (Why is no real title available?)
• On multiplication of 2 2 matrices
• On obtaining upper bounds on the complexity of matrix multiplication

Cited in

(4)

• A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
• Optimization techniques for small matrix multiplication
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
• Simultaneous Matrix Multiplication by Tensor Contraction Aggregation

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

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