A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications
Pages 118 - 121
Abstract
We present a 17-dimensional family of multiplication schemes for 3×3 matrices with 23 multiplications applicable to arbitrary coefficient rings.
References
[1]
Nicolas Courtois, Gregory V. Bard, and Daniel Hulme. A new general-purpose method to multiply 3 × 3 matrices using only 23 multiplications. CoRR, abs/1108.2830, 2011.
[2]
Marijn J.H. Heule, Manuel Kauers, and Martina Seidl. Matrix multiplication repository. http://www.algebra.uni-linz.ac.at/research/matrix-multiplication/. Accessed: 2019-04-26.
[3]
Marijn J.H. Heule, Manuel Kauers, and Martina Seidl. Local search for fast matrix multiplication. In Proceedings of SAT’19, 2019. to appear.
[4]
Marijn J.H. Heule, Manuel Kauers, and Martina Seidl. New ways to multiply 3 × 3 matrices. Technical Report 1905.10192, ArXiv, 2019.
[5]
Rodney W. Johnson and Aileen M. McLoughlin. Noncommutative bilinear algorithms for 3 × 3 matrix multiplication. SIAM J. Comput., 15(2):595–603, 1986.
[6]
Julian D. Laderman. A noncommutative algorithm for multiplying 3 × 3 matrices using 23 multiplications. Bulletin of the American Mathematical Society, 82(1):126–128, 1976.
[7]
Jinsoo Oh, Jin Kim, and Byung-Ro Moon. On the inequivalence of bilinear algorithms for 3 × 3 matrix multiplication. Information Processing Letters, 113(17):640–645, 2013.
[8]
A. V. Smirnov. The bilinear complexity and practical algorithms for matrix multiplication. Computational Mathematics and Mathematical Physics, 53(12):1781–1795, 2013.
[9]
Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354–356, 1969.
Recommendations
On optimal improvements of classical iterative schemes for Z-matrices
Many researchers have considered preconditioners, applied to linear systems, whose matrix coefficient is a Z-or an M-matrix, that make the associated Jacobi and Gauss-Seidel methods converge asymptotically faster than the unpreconditioned ones. Such ...
Comments
Information & Contributors
Information
Published In
Copyright © 2019 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 December 2019
Published in SIGSAM-CCA Volume 53, Issue 3
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 103Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in