{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:04:06Z","timestamp":1777593846078,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T00:00:00Z","timestamp":1191974400000},"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,10,23]]},"DOI":"10.1007\/s00211-007-0114-x","type":"journal-article","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T10:48:56Z","timestamp":1191926936000},"page":"59-91","source":"Crossref","is-referenced-by-count":143,"title":["Fast linear algebra is stable"],"prefix":"10.1007","volume":"108","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"}]}],"member":"297","published-online":{"date-parts":[[2007,10,10]]},"reference":[{"key":"114_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Blackford, S., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719604"},{"key":"114_CR2","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0908055","volume":"8","author":"T.W. Anderson","year":"1987","unstructured":"Anderson T.W., Olkin I. and Underhill L.G. (1987). Generation of random orthogonal matrices. SIAM J. Sci. Stat. Comput. 8: 625\u2013629","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"114_CR3","unstructured":"Bai, Z., Demmel, J.: Design of a parallel nonsymmetric eigenroutine toolbox, Part I. In: Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. SIAM. Long version available as UC Berkeley Computer Science report all.ps.Z via anonymous ftp from tr-ftp.cs.berkeley.edu, directory (1993) pub\/tech-reports\/csd\/csd-92-718"},{"key":"114_CR4","doi-asserted-by":"crossref","unstructured":"Bai, Z., Demmel, J.: Using the matrix sign function to compute invariant subspaces. SIAM J. Mat. Anal. Appl. 19 (1), 1998. Technical report title \u201cDesign of a Parallel Nonsymmetric Eigenroutine Toolbox, Part II\u201d","DOI":"10.1137\/S0895479896297719"},{"key":"114_CR5","doi-asserted-by":"crossref","unstructured":"Bai, Z., Demmel, J., Gu, M.: Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems. Numer. Math. 76, 279\u2013308, (1997). UC Berkeley CS Division Report UCB\/\/CSD-94-793, Feb 94","DOI":"10.1007\/s002110050264"},{"key":"114_CR6","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":"114_CR7","unstructured":"Bischof, C., Huss-Lederman, S., Sun, X., Tsao, A.: The PRISM project: Infrastructure and algorithms for parallel eigensolvers. In: Proceedings of the Scalable Parallel Libraries Conference, Mississippi State, Mississippi. IEEE Computer Society, 1993"},{"issue":"2","key":"114_CR8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/290200.287637","volume":"24","author":"C. Bischof","year":"1998","unstructured":"Bischof C. and Quintana-Orti G. (1998). Computing rank-revealing QR factorizations of dense matrices. ACM Trans. Math. Softw. 24(2): 226\u2013253","journal-title":"ACM Trans. Math. Softw."},{"key":"114_CR9","doi-asserted-by":"crossref","unstructured":"Bischof, C., Van Loan, C.: The WY representation for products of Householder matrices. SIAM J. Sci. Stat. Comput. 8(1), (1987)","DOI":"10.1137\/0908009"},{"key":"114_CR10","doi-asserted-by":"crossref","unstructured":"Blackford, L.S., Choi, J., Cleary, A., E. D\u2019Azevedo, Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users\u2019 Guide. SIAM, Philadelphia (1997)","DOI":"10.1137\/1.9780898719642"},{"key":"114_CR11","volume-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"A. Borodin","year":"1975","unstructured":"Borodin A. and Munro I. (1975). The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, Amsterdam"},{"key":"114_CR12","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":"5","key":"114_CR13","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1007\/BF00970267","volume":"29","author":"A.Ya. Bulgakov","year":"1988","unstructured":"Bulgakov A.Ya. and Godunov S.K. (1988). Circular dichotomy of the spectrum of a matrix. Siberian Math. J. 29(5): 734\u2013744","journal-title":"Siberian Math. J."},{"key":"114_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser P., Clausen M. and Shokrollahi M.A. (1997). Algebraic Complexity Theory. Springer, Berlin"},{"issue":"89","key":"114_CR15","first-page":"67","volume":"88","author":"T. Chan","year":"1987","unstructured":"Chan T. (1987). Rank revealing QR factorizations. Linear Algebra Appl. 88(89): 67\u201382","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"114_CR16","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1137\/S0895479891223781","volume":"15","author":"S. Chandrasekaran","year":"1994","unstructured":"Chandrasekaran S. and Ipsen I. (1994). On rank-revealing QR factorizations. SIAM J. Matrix Anal. Appl. 15(2): 592\u2013622","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"114_CR17","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 on 23\u201325 October 2005, pp. 379\u2013388 (2005)","DOI":"10.1109\/SFCS.2005.39"},{"key":"114_CR18","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":"114_CR19","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":"114_CR20","volume-title":"Algorithms","author":"R. Cormen","year":"1990","unstructured":"Cormen R., Leiserson C. and Rivest R. (1990). Algorithms. MIT\/McGraw-Hill, Cambridge\/New York"},{"key":"114_CR21","unstructured":"Day, D.: How the QR algorithm fails to converge and how to fix it. Technical Report 96-0913J, Sandia National Laboratory, April 1996"},{"key":"114_CR22","doi-asserted-by":"crossref","unstructured":"Demmel, J.: Applied Numerical Linear Algebra. SIAM, 1997","DOI":"10.1137\/1.9781611971446"},{"issue":"2","key":"114_CR23","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s00211-007-0061-6","volume":"106","author":"J. Demmel","year":"2007","unstructured":"Demmel J., Dumitriu I., Holtz O. and Kleinberg R. (2007). Fast matrix multiplication is stable. Numer. Math. 106(2): 199\u2013224","journal-title":"Numer. Math."},{"key":"114_CR24","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. Softw. 18: 274\u2013291","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"114_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/nla.1680020208","volume":"2","author":"J. Demmel","year":"1995","unstructured":"Demmel J., Higham N.J. and Schreiber R. (1995). Stability of block LU factorization, Numer. Linear Algebra Appl. 2(2): 173\u2013190","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"114_CR26","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1137\/0609045","volume":"9","author":"A. Edelman","year":"1988","unstructured":"Edelman A. (1988). Eigenvalues and condition numbers of random matrices. SIAM J. Math. Anal. Appl. 9(4): 543\u2013560","journal-title":"SIAM J. Math. Anal. Appl."},{"issue":"4","key":"114_CR27","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1147\/rd.444.0605","volume":"44","author":"E. Elmroth","year":"2000","unstructured":"Elmroth E. and Gustavson F. (2000). Applying recursion to serial and parallel QR factorization. IBM J. Res. Devel. 44(4): 605\u2013624","journal-title":"IBM J. Res. Devel."},{"issue":"5","key":"114_CR28","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/BF00969193","volume":"27","author":"S.K. Godunov","year":"1986","unstructured":"Godunov S.K. (1986). Problem of the dichotomy of the spectrum of a matrix. Siberian Math. J. 27(5): 649\u2013660","journal-title":"Siberian Math. J."},{"key":"114_CR29","volume-title":"Matrix Computations","author":"G. Golub","year":"1996","unstructured":"Golub G. and Van Loan C. (1996). Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore","edition":"3"},{"issue":"4","key":"114_CR30","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1137\/0917055","volume":"17","author":"M. Gu","year":"1996","unstructured":"Gu M. and Eisenstat S. (1996). An efficient algorithm for computing a strong rank\u2013revealing QR factorization. SIAM J. Sci. Comput. 17(4): 848\u2013869","journal-title":"SIAM J. Sci. Comput."},{"key":"114_CR31","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/1020096","volume":"20","author":"D. Heller","year":"1978","unstructured":"Heller D. (1978). A survey of parallel algorithms in numerical linear algebra. SIAM Rev. 20: 740\u2013777","journal-title":"SIAM Rev."},{"issue":"2","key":"114_CR32","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0916025","volume":"16","author":"N. Higham","year":"1995","unstructured":"Higham N. (1995). Stability of parallel triangular matrix systems solvers. SIAM J. Sci. Comput. 16(2): 400\u2013413","journal-title":"SIAM J. Sci. Comput."},{"key":"114_CR33","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. Softw. 16: 352\u2013368","journal-title":"ACM Trans. Math. Softw."},{"key":"114_CR34","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: Accuracy and stability of numerical algorithms, 2nd edn. SIAM, Philadelphia, PA (2002)","DOI":"10.1137\/1.9780898718027"},{"key":"114_CR35","first-page":"213","volume":"58","author":"P. Hong","year":"1992","unstructured":"Hong P. and Pan C.T. (1992). Rank-revealing QR factorizations and the singular value decomposition. Math. Comput. 58: 213\u2013232","journal-title":"Math. Comput."},{"issue":"1","key":"114_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129053300000084","volume":"11","author":"S. Huss","year":"2000","unstructured":"Huss S., Quintana E.S., Sun X. and Wu J. (2000). Parallel spectral division using the matrix sign function for the generalized eigenproblem. Int. J. High Speed Comput. 11(1): 1\u201314","journal-title":"Int. J. High Speed Comput."},{"key":"114_CR37","unstructured":"Huss-Lederman, S., Tsao, A., Zhang, G.: A parallel implementation of the invariant subspace decomposition algorithm for dense symmetric matrices. In: Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing. SIAM, 1993"},{"issue":"4","key":"114_CR38","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/BF00971756","volume":"30","author":"A.N. Malyshev","year":"1989","unstructured":"Malyshev A.N. (1989). Computing invariant subspaces of a regular linear pencil of matrices. Siberian Math. J. 30(4): 559\u2013567","journal-title":"Siberian Math. J."},{"key":"114_CR39","unstructured":"Malyshev, A.N.: Guaranteed accuracy in spectral problems of linear algebra, I,II. Siberian Adv. Math. 2 (1,2), 144\u2013197, 153\u2013204 (1992)"},{"key":"114_CR40","doi-asserted-by":"crossref","unstructured":"Malyshev, A.N.: Parallel algorithm for solving some spectral problems of linear algebra. Linear Algebra Appl. 188,189, 489\u2013520 (1993)","DOI":"10.1016\/0024-3795(93)90477-6"},{"key":"114_CR41","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316559","volume-title":"Aspects of Multivariate Statistical Theory","author":"R.J. Muirhead","year":"1982","unstructured":"Muirhead R.J. (1982). Aspects of Multivariate Statistical Theory. Wiley, New York"},{"key":"114_CR42","unstructured":"PRISM: Parallel Research on Invariant Subspace Methods. www-unix.mcs.anl.gov\/prism"},{"key":"114_CR43","doi-asserted-by":"crossref","unstructured":"Ran Raz.: On the complexity of matrix product. SIAM J. Comput. 32(5), 1356\u20131369 (electronic), (2003)","DOI":"10.1137\/S0097539702402147"},{"key":"114_CR44","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1080\/00207178008922881","volume":"32","author":"J. Roberts","year":"1980","unstructured":"Roberts J. (1980). Linear model reduction and solution of the algebraic Riccati equation. Inter. J. Control 32: 677\u2013687","journal-title":"Inter. J. Control"},{"key":"114_CR45","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":"114_CR46","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R. Schreiber","year":"1989","unstructured":"Schreiber R. and Van Loan C. (1989). A storage efficient WY representation for products of Householder transformations. SIAM J. Sci. Stat. Comput. 10: 53\u201357","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"114_CR47","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/0614034","volume":"14","author":"G.W. Stewart","year":"1993","unstructured":"Stewart G.W. (1993). Updating a rank-revealing ULV decomposition. SIAM J. Math. Anal. Appl. 14(2): 494\u2013499","journal-title":"SIAM J. Math. Anal. Appl."},{"key":"114_CR48","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"G.W. Stewart","year":"1980","unstructured":"Stewart G.W. (1980). The efficient generation of random orthogonal matrices with an application to condition estimation. SIAM J. Numer. Anal. 17: 403\u2013409","journal-title":"SIAM J. Numer. Anal."},{"key":"114_CR49","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."},{"issue":"4","key":"114_CR50","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1137\/S0895479896297744","volume":"18","author":"S. Toledo","year":"1997","unstructured":"Toledo S. (1997). Locality of reference in LU decomposition with partial pivoting. SIAM J. Math. Anal. Appl. 18(4): 1065\u20131081","journal-title":"SIAM J. Math. Anal. Appl."},{"key":"114_CR51","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0716016","volume":"16","author":"J. Varah","year":"1979","unstructured":"Varah J. (1979). On the separation of two matrices. SIAM J. Numer. Anal. 16: 216\u2013222","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-007-0114-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-007-0114-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-007-0114-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T13:37:29Z","timestamp":1737466649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-007-0114-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,10]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,10,23]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s00211-007-0114-x","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,10]]}}}