{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T05:15:24Z","timestamp":1779167724047,"version":"3.51.4"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003483","name":"Hebrew University of Jerusalem","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003483","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Alternative basis matrix multiplication algorithms are the fastest matrix multiplication algorithms in practice to date. However, are they numerically stable? We obtain the first numerical error bound for alternative basis matrix multiplication algorithms. Particularly, we derive a novel fast matrix multiplication algorithm with a 2-by-2 base case that simultaneously attains the optimal leading coefficient for arithmetic costs, and achieves an improved asymptotic error bound. We further show that arithmetic costs and error bounds of alternative basis algorithms can be simultaneously optimized. We provide high-performance parallel implementations of our algorithms with benchmarks showing that our algorithm is on par with the best in class for speed, and the best in class of for stability. Finally, we show that diagonal scaling stability improvement techniques for fast matrix multiplication are as effective for alternative basis algorithms, both theoretically and empirically. These findings promote the use of alternative basis matrix multiplication algorithms in practical applications.<\/jats:p>","DOI":"10.1007\/s00211-026-01531-9","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T06:49:15Z","timestamp":1772088555000},"page":"1151-1185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Alternative Basis matrix multiplication is fast and stable\u2020"],"prefix":"10.1007","volume":"158","author":[{"given":"Oded","family":"Schwartz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Vaknin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gal","family":"Wiernik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,26]]},"reference":[{"key":"1531_CR1","doi-asserted-by":"crossref","unstructured":"Schwartz, O., Toledo, S., Vaknin, N., Wiernik, G.: Alternative Basis Matrix Multiplication is Fast and Stable. In: 2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, San Francisco CA USA (2024). To appear","DOI":"10.1109\/IPDPS57955.2024.00013"},{"issue":"4","key":"1531_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354\u2013356 (1969). https:\/\/doi.org\/10.1007\/BF02165411","journal-title":"Numer. Math."},{"key":"1531_CR3","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A Refined Laser Method and Faster Matrix Multiplication. In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201921, pp. 522\u2013539. Society for Industrial and Applied Mathematics, USA (2021). event-place: Virtual Event, Virginia","DOI":"10.1137\/1.9781611976465.32"},{"issue":"1","key":"1531_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02575865","volume":"17","author":"D Bini","year":"1980","unstructured":"Bini, D.: Relations between exact and approximate bilinear algorithms. Appl. Calcolo 17(1), 87\u201397 (1980). https:\/\/doi.org\/10.1007\/BF02575865","journal-title":"Appl. Calcolo"},{"issue":"3","key":"1531_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990). https:\/\/doi.org\/10.1016\/S0747-7171(08)80013-2","journal-title":"J. Symb. Comput."},{"key":"1531_CR6","doi-asserted-by":"publisher","unstructured":"Cohn, H., Umans, C.: A group-theoretic approach to fast matrix multiplication. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp. 438\u2013449. IEEE Computer. Soc, Cambridge, MA, USA (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238217 . http:\/\/ieeexplore.ieee.org\/document\/1238217\/","DOI":"10.1109\/SFCS.2003.1238217"},{"issue":"2","key":"1531_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0308210511001648","volume":"143","author":"AM Davie","year":"2013","unstructured":"Davie, A.M., Stothers, A.J.: Improved bound for complexity of matrix multiplication. Proc. R. Soc. Edinb. Sect. A Math. 143(2), 351\u2013369 (2013). https:\/\/doi.org\/10.1017\/S0308210511001648","journal-title":"Proc. R. Soc. Edinb. Sect. A Math."},{"key":"1531_CR8","doi-asserted-by":"publisher","unstructured":"Le\u00a0Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303. ACM, Kobe Japan (2014). https:\/\/doi.org\/10.1145\/2608628.2608664","DOI":"10.1145\/2608628.2608664"},{"issue":"3","key":"1531_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0210032","volume":"10","author":"A Sch\u00f6nhage","year":"1981","unstructured":"Sch\u00f6nhage, A.: Partial and total matrix multiplication. SIAM J. Comput. 10(3), 434\u2013455 (1981). https:\/\/doi.org\/10.1137\/0210032","journal-title":"SIAM J. Comput."},{"key":"1531_CR10","doi-asserted-by":"publisher","unstructured":"Williams, V.V.: Multiplying matrices faster than coppersmith-winograd. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, pp. 887\u2013898. ACM, New York New York USA (2012). https:\/\/doi.org\/10.1145\/2213977.2214056","DOI":"10.1145\/2213977.2214056"},{"key":"1531_CR11","doi-asserted-by":"publisher","unstructured":"Karstadt, E., Schwartz, O.: Matrix Multiplication, a Little Faster. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 101\u2013110. ACM, Washington DC USA (2017). https:\/\/doi.org\/10.1145\/3087556.3087579","DOI":"10.1145\/3087556.3087579"},{"issue":"1","key":"1531_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3364504","volume":"67","author":"E Karstadt","year":"2020","unstructured":"Karstadt, E., Schwartz, O.: Matrix multiplication, a little faster. J. ACM 67(1), 1\u201331 (2020). https:\/\/doi.org\/10.1145\/3364504","journal-title":"J. ACM"},{"key":"1531_CR13","doi-asserted-by":"publisher","unstructured":"Beniamini, G., Cheng, N., Holtz, O., Karstadt, E., Schwartz, O.: Sparsifying the Operators of Fast Matrix Multiplication Algorithms (2020) https:\/\/doi.org\/10.48550\/ARXIV.2008.03759. Publisher: arXiv Version Number: 1","DOI":"10.48550\/ARXIV.2008.03759"},{"key":"1531_CR14","doi-asserted-by":"publisher","unstructured":"Beniamini, G., Schwartz, O.: Faster Matrix Multiplication via Sparse Decomposition. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pp. 11\u201322. ACM, Phoenix AZ USA (2019). https:\/\/doi.org\/10.1145\/3323165.3323188","DOI":"10.1145\/3323165.3323188"},{"key":"1531_CR15","doi-asserted-by":"publisher","unstructured":"Benson, A.R., Ballard, G.: A framework for practical parallel fast matrix multiplication. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 42\u201353. ACM, San Francisco CA USA (2015). https:\/\/doi.org\/10.1145\/2688500.2688513","DOI":"10.1145\/2688500.2688513"},{"key":"1531_CR16","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.jsc.2016.07.004","volume":"80","author":"M Cenk","year":"2017","unstructured":"Cenk, M., Hasan, M.A.: On the arithmetic complexity of Strassen-like matrix multiplications. J. Symb. Comput. 80, 484\u2013501 (2017). https:\/\/doi.org\/10.1016\/j.jsc.2016.07.004","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1531_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0120004","volume":"20","author":"JE Hopcroft","year":"1971","unstructured":"Hopcroft, J.E., Kerr, L.R.: On minimizing the number of multiplications necessary for matrix multiplication. SIAM J. Appl. Math. 20(1), 30\u201336 (1971). https:\/\/doi.org\/10.1137\/0120004","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"1531_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/0215043","volume":"15","author":"RW Johnson","year":"1986","unstructured":"Johnson, R.W., McLoughlin, A.M.: Noncommutative bilinear algorithms for 3 x 3 matrix multiplication. SIAM J. Comput. 15(2), 595\u2013603 (1986). https:\/\/doi.org\/10.1137\/0215043","journal-title":"SIAM J. Comput."},{"key":"1531_CR19","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0024-3795(92)90393-O","volume":"162\u2013164","author":"J Laderman","year":"1992","unstructured":"Laderman, J., Pan, V., Sha, X.-H.: On practical algorithms for accelerated matrix multiplication. Linear Algebra Appl. 162\u2013164, 557\u2013588 (1992). https:\/\/doi.org\/10.1016\/0024-3795(92)90393-O","journal-title":"Linear Algebra Appl."},{"key":"1531_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"JD Laderman","year":"1976","unstructured":"Laderman, J.D.: A noncommutative algorithm for multiplying 3 x 3 matrices using 23 multiplications. Bull. Am. Math. Soc. 82, 126\u2013128 (1976)","journal-title":"Bull. Am. Math. Soc."},{"key":"1531_CR21","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Strassen\u2019s algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 166\u2013176 (1978)","DOI":"10.1109\/SFCS.1978.34"},{"issue":"1","key":"1531_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0898-1221(82)90037-2","volume":"8","author":"VY Pan","year":"1982","unstructured":"Pan, V.Y.: Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication. Comput. Math. Appl. 8(1), 23\u201334 (1982). https:\/\/doi.org\/10.1016\/0898-1221(82)90037-2","journal-title":"Comput. Math. Appl."},{"issue":"12","key":"1531_CR23","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1134\/S0965542513120129","volume":"53","author":"AV Smirnov","year":"2013","unstructured":"Smirnov, A.V.: The bilinear complexity and practical algorithms for matrix multiplication. Comput. Math. Math. Phys. 53(12), 1781\u20131795 (2013). https:\/\/doi.org\/10.1134\/S0965542513120129","journal-title":"Comput. Math. Math. Phys."},{"key":"1531_CR24","unstructured":"Smirnov, A.V.: Several bilinear algorithms for matrix multiplication. Technical report (2017)"},{"issue":"1","key":"1531_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01395989","volume":"36","author":"D Bini","year":"1980","unstructured":"Bini, D., Lotti, G.: Stability of fast algorithms for matrix multiplication. Numer. Math. 36(1), 63\u201372 (1980). https:\/\/doi.org\/10.1007\/BF01395989","journal-title":"Numer. Math."},{"issue":"4","key":"1531_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"Winograd, S.: On multiplication of 2 $$\\times $$ 2 matrices. Linear Algebra Appl. 4(4), 381\u2013388 (1971). https:\/\/doi.org\/10.1016\/0024-3795(71)90009-7","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1531_CR27","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0205016","volume":"5","author":"RL Probert","year":"1976","unstructured":"Probert, R.L.: On the additive complexity of matrix multiplication. SIAM J. Comput. 5(2), 187\u2013203 (1976). https:\/\/doi.org\/10.1137\/0205016","journal-title":"SIAM J. Comput."},{"issue":"6","key":"1531_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0020-0190(95)00176-X","volume":"56","author":"NH Bshouty","year":"1995","unstructured":"Bshouty, N.H.: On the additive complexity of 2 $$\\times $$ 2 matrix multiplication. Inf. Process. Lett. 56(6), 329\u2013335 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00176-X","journal-title":"Inf. Process. Lett."},{"key":"1531_CR29","doi-asserted-by":"publisher","unstructured":"Bodrato, M.: A Strassen-like Matrix Multiplication Suited for Squaring and Higher Power Computation. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201910, pp. 273\u2013280. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1837934.1837987 . event-place: Munich, Germany","DOI":"10.1145\/1837934.1837987"},{"key":"1531_CR30","doi-asserted-by":"publisher","unstructured":"Moran, Y., Schwartz, O.: Multiplying 2 $$\\times $$ 2 Sub-Blocks Using 4 Multiplications. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA \u201923, pp. 379\u2013390. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3558481.3591083 . event-place: Orlando, FL, USA","DOI":"10.1145\/3558481.3591083"},{"issue":"2","key":"1531_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/0204009","volume":"4","author":"W Miller","year":"1975","unstructured":"Miller, W.: Computational complexity and numerical stability. SIAM J. Comput. 4(2), 97\u2013107 (1975). https:\/\/doi.org\/10.1137\/0204009. (Publisher: Society for Industrial & Applied Mathematics (SIAM))","journal-title":"SIAM J. Comput."},{"key":"1531_CR32","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Algorithms for matrix multiplication. Technical Report TR-CS-70-157, Stanford University (March 1970)","DOI":"10.21236\/AD0705509"},{"issue":"2","key":"1531_CR33","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02308867","volume":"16","author":"RP Brent","year":"1970","unstructured":"Brent, R.P.: Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd\u2019s identity. Numer. Math. 16(2), 145\u2013156 (1970). https:\/\/doi.org\/10.1007\/BF02308867","journal-title":"Numer. Math."},{"issue":"2","key":"1531_CR34","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s00211-007-0061-6","volume":"106","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Dumitriu, I., Holtz, O., Kleinberg, R.: Fast matrix multiplication is stable. Numer. Math. 106(2), 199\u2013224 (2007). https:\/\/doi.org\/10.1007\/s00211-007-0061-6. (Publisher: Springer Science and Business Media LLC)","journal-title":"Numer. Math."},{"issue":"4","key":"1531_CR35","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/15m1032168","volume":"37","author":"G Ballard","year":"2016","unstructured":"Ballard, G., Benson, A.R., Druinsky, A., Lipshitz, B., Schwartz, O.: Improving the numerical stability of fast matrix multiplication. SIAM J. Matrix Anal. Appl. 37(4), 1382\u20131418 (2016). https:\/\/doi.org\/10.1137\/15m1032168. (Publisher: Society for Industrial & Applied Mathematics (SIAM))","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1531_CR36","unstructured":"Castrapel, R.R., Gustafson, J.L.: Precision Improvement Method for the Strassen\/Winograd Matrix Multiplication Method. 7,209,939, April (2007). http:\/\/www.google.com\/patents\/US7209939"},{"issue":"01","key":"1531_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.4236\/alamt.2014.41002","volume":"04","author":"P D\u2019Alberto","year":"2014","unstructured":"D\u2019Alberto, P.: The better accuracy of strassen-winograd algorithms (FastMMW). Adv. Linear Algebra Matrix Theory 04(01), 9\u201339 (2014). https:\/\/doi.org\/10.4236\/alamt.2014.41002","journal-title":"Adv. Linear Algebra Matrix Theory"},{"key":"1531_CR38","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd, ed Society for Industrial and Applied Mathematics, Philadelphia (2002)","DOI":"10.1137\/1.9780898718027"},{"issue":"4","key":"1531_CR39","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/98267.98290","volume":"16","author":"NJ Higham","year":"1990","unstructured":"Higham, N.J.: Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Softw. 16(4), 352\u2013368 (1990). https:\/\/doi.org\/10.1145\/98267.98290","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"1531_CR40","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s002110050348","volume":"79","author":"B Dumitrescu","year":"1998","unstructured":"Dumitrescu, B.: Improving and estimating the accuracy of Strassen\u2019s algorithm. Numer. Math. 79(4), 485\u2013499 (1998). https:\/\/doi.org\/10.1007\/s002110050348","journal-title":"Numer. Math."},{"issue":"1","key":"1531_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00211-007-0114-x","volume":"108","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Dumitriu, I., Holtz, O.: Fast linear algebra is stable. Numer. Math. 108(1), 59\u201391 (2007). https:\/\/doi.org\/10.1007\/s00211-007-0114-x","journal-title":"Numer. Math."},{"issue":"6","key":"1531_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2395116.2395121","volume":"59","author":"G Ballard","year":"2012","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM 59(6), 1\u201323 (2012). https:\/\/doi.org\/10.1145\/2395116.2395121","journal-title":"J. ACM"},{"key":"1531_CR43","doi-asserted-by":"publisher","unstructured":"Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Communication-optimal parallel algorithm for strassen\u2019s matrix multiplication. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 193\u2013204. ACM, Pittsburgh Pennsylvania USA (2012). https:\/\/doi.org\/10.1145\/2312005.2312044","DOI":"10.1145\/2312005.2312044"},{"key":"1531_CR44","doi-asserted-by":"crossref","unstructured":"Desprez, F., Suter, F.: Impact of Mixed-Parallelism on Parallel Implementations of the Strassen and Winograd Matrix Multiplication Algorithms: Research Articles. Concurr. Comput. : Pract. Exper. 16(8), 771\u2013797 (2004). Place: GBR Publisher: John Wiley and Sons Ltd","DOI":"10.1002\/cpe.791"},{"issue":"01","key":"1531_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626496000029","volume":"06","author":"B Grayson","year":"1996","unstructured":"Grayson, B., Van De Geijn, R.: A high performance parallel strassen implementation. Parallel Process. Lett. 06(01), 3\u201312 (1996). https:\/\/doi.org\/10.1142\/S0129626496000029","journal-title":"Parallel Process. Lett."},{"key":"1531_CR46","doi-asserted-by":"publisher","unstructured":"Luo, Q., Drake, J.B.: A Scalable Parallel Strassen\u2019s Matrix Multiplication Algorithm for Distributed-Memory Computers. In: Proceedings of the 1995 ACM Symposium on Applied Computing. SAC \u201995, pp. 221\u2013226. Association for Computing Machinery, New York, NY, USA (1995). https:\/\/doi.org\/10.1145\/315891.315965 . event-place: Nashville, Tennessee, USA","DOI":"10.1145\/315891.315965"},{"key":"1531_CR47","doi-asserted-by":"crossref","unstructured":"Lipshitz, B., Ballard, G., Demmel, J., Schwartz, O.: Communication-Avoiding Parallel Strassen: Implementation and Performance. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. SC \u201912. IEEE Computer Society Press, Washington, DC, USA (2012). event-place: Salt Lake City, Utah","DOI":"10.1109\/SC.2012.33"},{"issue":"3\u20134","key":"1531_CR48","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00008264","volume":"24","author":"WF McColl","year":"1999","unstructured":"McColl, W.F., Tiskin, A.: Memory-efficient matrix multiplication in the BSP model. Algorithmica 24(3\u20134), 287\u2013297 (1999). https:\/\/doi.org\/10.1007\/PL00008264","journal-title":"Algorithmica"},{"key":"1531_CR49","doi-asserted-by":"crossref","unstructured":"Schwartz, O., Vaknin, N.: Pebbling Game and Alternative Basis for High Performance Matrix Multiplication. SIAM J. Sci. Comput. (2023). To appear","DOI":"10.1137\/22M1502719"},{"key":"1531_CR50","unstructured":"Cannon, L.E.: A Cellular Computer to Implement the Kalman Filter Algorithm. PhD Thesis, Montana State University, USA (1969)"},{"key":"1531_CR51","doi-asserted-by":"crossref","unstructured":"Van De\u00a0Geijn, R.A., Watts, J.: SUMMA: scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience 9(4), 255\u2013274 (1997). https:\/\/doi.org\/10.1002\/(SICI)1096-9128(199704)9:4$$<$$255::AID-CPE250$$>$$3.0.CO;2-2","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2"},{"issue":"5","key":"1531_CR52","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1147\/rd.395.0575","volume":"39","author":"RC Agarwal","year":"1995","unstructured":"Agarwal, R.C., Balle, S.M., Gustavson, F.G., Joshi, M., Palkar, P.: A three-dimensional approach to parallel matrix multiplication. IBM J. Res. Dev. 39(5), 575\u2013582 (1995). https:\/\/doi.org\/10.1147\/rd.395.0575","journal-title":"IBM J. Res. Dev."},{"key":"1531_CR53","doi-asserted-by":"publisher","unstructured":"Solomonik, E., Demmel, J.: Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011 Parallel Processing vol. 6853, pp. 90\u2013109. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23397-5_10 . Series Title: Lecture Notes in Computer Science","DOI":"10.1007\/978-3-642-23397-5_10"},{"key":"1531_CR54","doi-asserted-by":"publisher","unstructured":"Karppa, M., Kaski, P.: Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures (2019). https:\/\/doi.org\/10.48550\/ARXIV.1909.01554 . Publisher: arXiv Version Number: 1","DOI":"10.48550\/ARXIV.1909.01554"},{"key":"1531_CR55","doi-asserted-by":"publisher","unstructured":"Dumas, J.-G., Pernet, C., Sedoglavic, A.: Strassen\u2019s algorithm is not optimally accurate. In: Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, pp. 254\u2013263. ACM, Raleigh NC USA (2024). https:\/\/doi.org\/10.1145\/3666000.3669697","DOI":"10.1145\/3666000.3669697"},{"issue":"7930","key":"1531_CR56","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi, A., Balog, M., Huang, A., Hubert, T., Romera-Paredes, B., Barekatain, M., Novikov, A., Ruiz, R., Schrittwieser, F.J., Swirszcz, J., Silver, D., Hassabis, D., Kohli, P.: Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610(7930), 47\u201353 (2022). https:\/\/doi.org\/10.1038\/s41586-022-05172-4","journal-title":"Nature"},{"issue":"3","key":"1531_CR57","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0024-3795(78)90012-5","volume":"19","author":"RW Brockett","year":"1978","unstructured":"Brockett, R.W., Dobkin, D.: On the optimal evaluation of a set of bilinear forms. Linear Algebra Appl. 19(3), 207\u2013235 (1978). https:\/\/doi.org\/10.1016\/0024-3795(78)90012-5","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1531_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(78)90038-5","volume":"7","author":"HF De Groote","year":"1978","unstructured":"De Groote, H.F.: On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping. Theoret. Comput. Sci. 7(1), 1\u201324 (1978). https:\/\/doi.org\/10.1016\/0304-3975(78)90038-5","journal-title":"Theoret. Comput. Sci."},{"key":"1531_CR59","doi-asserted-by":"publisher","unstructured":"Boyer, B., Dumas, J.-G., Pernet, C., Zhou, W.: Memory efficient scheduling of Strassen-Winograd\u2019s matrix multiplication algorithm. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 55\u201362. ACM, Seoul Republic of Korea (2009). https:\/\/doi.org\/10.1145\/1576702.1576713","DOI":"10.1145\/1576702.1576713"},{"key":"1531_CR60","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.jsc.2020.10.003","volume":"104","author":"MJH Heule","year":"2021","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply 3 $$\\times $$ 3-matrices. J. Symb. Comput. 104, 899\u2013916 (2021). https:\/\/doi.org\/10.1016\/j.jsc.2020.10.003","journal-title":"J. Symb. Comput."},{"key":"1531_CR61","unstructured":"Intel\u00aeoneAPI: math kernel library (2020). https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/tools\/oneapi\/onemkl.html"},{"key":"1531_CR62","doi-asserted-by":"publisher","unstructured":"Dumas, J.-G., Pernet, C., Sedoglavic, A.: A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications. https:\/\/doi.org\/10.48550\/arXiv.2506.13242 . arXiv:2506.13242 [cs] (2025). Accessed 2025-08-31","DOI":"10.48550\/arXiv.2506.13242"},{"key":"1531_CR63","doi-asserted-by":"publisher","unstructured":"Novikov, A., V\u0169, N., Eisenberger, M., Dupont, E., Huang, P.-S., Wagner, A.Z., Shirobokov, S., Kozlovskii, B., Ruiz, F.J.R., Mehrabian, A., Kumar, M.P., See, A., Chaudhuri, S., Holland, G., Davies, A., Nowozin, S., Kohli, P., Balog, M.: AlphaEvolve: A coding agent for scientific and algorithmic discovery (2025). https:\/\/doi.org\/10.48550\/arXiv.2506.13131arXiv: 2506.13131 [cs] Accessed 2025-08-31","DOI":"10.48550\/arXiv.2506.13131"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01531-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-026-01531-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01531-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T05:04:09Z","timestamp":1779167049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-026-01531-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,26]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1531"],"URL":"https:\/\/doi.org\/10.1007\/s00211-026-01531-9","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,26]]},"assertion":[{"value":"22 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}