{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:38:43Z","timestamp":1774352323037,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T00:00:00Z","timestamp":1170979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2007,3,27]]},"DOI":"10.1007\/s00211-007-0061-6","type":"journal-article","created":{"date-parts":[[2007,2,8]],"date-time":"2007-02-08T05:49:59Z","timestamp":1170913799000},"page":"199-224","source":"Crossref","is-referenced-by-count":47,"title":["Fast matrix multiplication is stable"],"prefix":"10.1007","volume":"106","author":[{"given":"James","family":"Demmel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Dumitriu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Holtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,9]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E. Anderson","year":"1999","unstructured":"Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Du Croz J., Greenbaum A., Hammarling S., McKenney A., Blackford S. and Sorensen D. (1999). LAPACK Users\u2019 Guide. SIAM, Philadelphia","edition":"3"},{"key":"61_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01395989","volume":"36","author":"D. Bini","year":"1980","unstructured":"Bini D. and Lotti D. (1980). Stability of fast algorithms for matrix multiplication. Numer. Math. 36: 63\u201372","journal-title":"Numer. Math."},{"key":"61_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK Users\u2019 Guide","author":"L.S. Blackford","year":"1997","unstructured":"Blackford L.S., Choi J., Cleary A., D\u2019Azevedo E., Demmel J., Dhillon I., Dongarra J., Hammarling S., Henry G., Petitet A., Stanley K., Walker D. and Whaley R.C. (1997). ScaLAPACK Users\u2019 Guide. SIAM, Philadelphia"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Algorithms for matrix multiplication. Report CS 157, Computer Science Department, Stanford University (1970)","DOI":"10.21236\/AD0705509"},{"issue":"3","key":"61_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(78)90012-5","volume":"19","author":"R.W. Brockett","year":"1978","unstructured":"Brockett R.W. and Dobkin D. (1978). On the optimal evaluation of a set of bilinear forms. Linear Algebra Appl. 19(3): 207\u2013235","journal-title":"Linear Algebra Appl."},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. In: der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 315. Springer, Berlin (1997)","DOI":"10.1007\/978-3-662-03338-8"},{"key":"61_CR7","doi-asserted-by":"crossref","unstructured":"Cohn, H., Kleinberg, R., Szegedy, B., Umans, C.: Group-theoretic algorithms for matrix multiplication. In: Foundations of Computer Science. 46th Annual IEEE Symposium, 23\u201325 October 2005, pp. 379\u2013388 (2005)","DOI":"10.1109\/SFCS.2005.39"},{"key":"61_CR8","unstructured":"Cohn, H., Kleinberg, R., Szegedy, B., Umans, C.: Implementing group-theoretic algorithms for matrix multiplication using the abelian discrete Fourier transform (in preparation)"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Cohn, H., Umans, C.: A group-theoretic approach to matrix multiplication. In: Foundations of Computer Science. 44th Annual IEEE Symposium, pp. 438\u2013449 (2003)","DOI":"10.1109\/SFCS.2003.1238217"},{"issue":"3","key":"61_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith D. and Winograd S. (1990). Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9(3): 251\u2013280","journal-title":"J. Symbolic Comput."},{"key":"61_CR11","doi-asserted-by":"crossref","unstructured":"Demmel, J., Dumitriu, I., Holtz, O.: Fast linear algebra is stable (2006, in preparation)","DOI":"10.1007\/s00211-007-0114-x"},{"key":"61_CR12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/131766.131769","volume":"18","author":"J. Demmel","year":"1992","unstructured":"Demmel J. and Higham N.J. (1992). Stability of block algorithms with fast level 3 BLAS. ACM Trans. Math. Soft. 18: 274\u2013291","journal-title":"ACM Trans. Math. Soft."},{"key":"61_CR13","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/98267.98290","volume":"16","author":"N.J. Higham","year":"1990","unstructured":"Higham N.J. (1990). Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Soft. 16: 352\u2013368","journal-title":"ACM Trans. Math. Soft."},{"key":"61_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"N.J. Higham","year":"2002","unstructured":"Higham N.J. (2002). Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia","edition":"2"},{"issue":"10","key":"61_CR15","first-page":"1151","volume":"48","author":"D.K. Maslen","year":"2001","unstructured":"Maslen D.K. and Rockmore D.N. (2001). The Cooley\u2013Tukey FFT and group theory. Not. Am. Math. Soc. 48(10): 1151\u20131160","journal-title":"Not. Am. Math. Soc."},{"issue":"2","key":"61_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/0204009","volume":"4","author":"W. Miller","year":"1975","unstructured":"Miller W. (1975). Computational complexity and numerical stability. SIAM J. Comput. 4(2): 97\u2013107","journal-title":"SIAM J. Comput."},{"issue":"5","key":"61_CR17","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1137\/S0097539702402147","volume":"32","author":"R. Raz","year":"2003","unstructured":"Raz R. (2003). On the complexity of matrix product. SIAM J. Comput. 32(5): 1356\u20131369. electronic","journal-title":"SIAM J. Comput."},{"key":"61_CR18","first-page":"281","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage A. and Strassen V. (1971). Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7: 281\u2013292","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"61_CR19","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen V. (1969). Gaussian elimination is not optimal. Numer. Math. 13: 354\u2013356","journal-title":"Numer. Math."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-007-0061-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-007-0061-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-007-0061-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T12:22:39Z","timestamp":1558614159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-007-0061-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,27]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s00211-007-0061-6","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,9]]}}}