{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:45Z","timestamp":1725488805748},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417293"},{"type":"electronic","value":"9783540707349"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-70734-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T09:01:45Z","timestamp":1186909305000},"page":"103-112","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Minimal Storage Symmetric Indefinite Solver"],"prefix":"10.1007","author":[{"given":"Fred","family":"Gustavson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Karaivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minka","family":"Marinova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Wa\u015bniewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Plamen","family":"Yalamov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,10]]},"reference":[{"key":"14_CR1","unstructured":"B. Andersen, F. Gustavson, and J. Wa\u015bniewski, A recursive Formulation of the Cholesky Factorization Operating on a Matrix in Packed Storage Form, University of Tennessee, Knoxville, TN, Computer Science Dept. Technical ReportCS-00-441, May 2000, also LAPACK Working Note number 146 ( http:\/\/www.netlib.org\/lapack\/lawns\/lawn146.ps ), and submitted to the Transaction of thematical Software (TOMS) of the ACM."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, LAPACK Users\u2019 Guide Release 3.0, SIAM, Philadelphia, 1999, ( http:\/\/www.netlib.org\/lapack\/lug\/lapack lug.html ).","DOI":"10.1137\/1.9780898719604"},{"issue":"#4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1147\/rd.444.0605","volume":"44","author":"E. Elmroth","year":"2000","unstructured":"E. Elmroth and F. Gustavson, Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance, IBM Journal of Research and Development, 44, #4, 605\u2013624, 2000","journal-title":"IBM Journal of Research and Development"},{"key":"14_CR4","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1996","unstructured":"G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd edition, The John Hopkins University Press, Baltimore, 1996.","edition":"3rd edition"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1147\/rd.416.0737","volume":"41","author":"F. Gustavson","year":"1997","unstructured":"F. Gustavson, Recursion leads to automatic variable blocking for dense linearalgebra algorithms, IBM J. Res. Develop., 41 (1997), pp. 737\u2013755.","journal-title":"IBM J. Res. Develop."},{"key":"14_CR6","unstructured":"F. Gustavson, A. Karaivanov, J. Wa\u015bniewski, and P. Yalamov, Recursive formulation of algorithms for symmetric indefinite linear systems (manuscript)."},{"key":"14_CR7","unstructured":"F. Gustavson, A. Henriksson, I. Jonsson, B. K\u00e5gstr\u00f6m, and P. Ling, Recursive Blocked Data Formats and BLAS\u2019s for Dense Linear Algebra Algorithms, in Applied Parallel Computing, B. K\u00e5gstr\u00f6m et. al., eds., Lecture Notes in Computers Science, v. 1541, Springer, 1998, pp. 120\u2013128."},{"key":"14_CR8","unstructured":"N. J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. New Paradigms for HPC in Industry and Academia"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-70734-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:04:59Z","timestamp":1556755499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70734-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417293","9783540707349"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-70734-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}