{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T08:51:41Z","timestamp":1768121501798,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1007\/bf00129836","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T09:44:31Z","timestamp":1099734271000},"page":"357-371","source":"Crossref","is-referenced-by-count":48,"title":["Using Strassen's algorithm to accelerate the solution of linear systems"],"prefix":"10.1007","volume":"4","author":[{"given":"David H.","family":"Bailey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"King","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst D.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"CR1","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/0909040","volume":"9","author":"D.H. Bailey","year":"1988","unstructured":"Bailey, D.H. 1988. Extra high speed matrix multiplication on the CRAY-2. SIAM J. Sci. Stat. Comp., 9, 3: 603?607.","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"CR2","unstructured":"Bischof, C., Demmel, J., Dongarra, J., DuCroz, J., Greenbaum, A., Hammarling, S., and Sorensen, D. 1988. LAPACK working note #5-Provisional contents. Tech. rept. ANL-88-38, Argonne Nat. Laboratory (Sept.)."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Brent, R.P. 1970. Algorithms for matrix multiplication. Tech. rept. CS 157, Comp. Sci. Dept., Stanford Univ.","DOI":"10.21236\/AD0705509"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., and Winograd, S. 1987. Matrix multiplication via arithmetic progression. In Proc., 19th Annual ACM Symp. on the Theory of Computing, pp. 1?6.","DOI":"10.1145\/28395.28396"},{"key":"CR5","unstructured":"Cray Research, Inc. 1989. UNICOS Math and Scientific Library Reference Manual. No. SR-2081, Version 5.0 (Mar.)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Dongarra, J.J., DuCroz, J., Duff, I., and Hammarling, S. 1988a. A set of Level 3 basic linear algebra subprograms. Tech. rept. MCS-P1-0888, MCSD, Argonne Nat. Laboratory (Aug.).","DOI":"10.1145\/36318.36319"},{"key":"CR7","unstructured":"Dongarra, J.J., DuCroz, J., Duff, I., and Hammarling, S. 1988b. A set of Level 3 basic linear algebra subprograms: Model implementation and test programs. Tech. rept. MCS-P2-0888, MCSD, Argonne Nat. Laboratory (Aug.)."},{"key":"CR8","unstructured":"Gentleman, M.J. 1988. Private commun."},{"key":"CR9","series-title":"Tech. rept. TR 89-984","volume-title":"Exploiting fast matrix multiplication within the Level 3 BLAS","author":"N.J. Higham","year":"1989","unstructured":"Higham, N.J. 1989. Exploiting fast matrix multiplication within the Level 3 BLAS. Tech. rept. TR 89?984, Dept. of Comp. Sci., Cornell Univ., Ithaca, N.Y. (Apr.). (To appear in ACM TOMS.)"},{"key":"CR10","unstructured":"Higham, N.J. 1990. Stability of a method for multiplying complex matrices with three real matrix multiplications. Numerical Analysis Rept. 181, Dept. of Math., Univ. of Manchester (Jan.)."},{"key":"CR11","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. Computing, 4: 97?107.","journal-title":"SIAM J. Computing"},{"key":"CR12","volume-title":"Numerical Recipes","author":"W.H. Press","year":"1986","unstructured":"Press, W.H., Flannery, B.P., Teukolsky, S.A., and Vetterling, T. 1986. Numerical Recipes. Cambridge Univ. Press, N.Y."},{"key":"CR13","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?356.","journal-title":"Numer. Math."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129836\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T23:46:18Z","timestamp":1682811978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["BF00129836"],"URL":"https:\/\/doi.org\/10.1007\/bf00129836","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}