{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:29Z","timestamp":1725664649146},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620952"},{"type":"electronic","value":"9783540496434"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62095-8_70","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:35:35Z","timestamp":1330295735000},"page":"651-660","source":"Crossref","is-referenced-by-count":3,"title":["A highly parallel explicitly restarted Lanczos algorithm"],"prefix":"10.1007","author":[{"given":"M.","family":"Szularz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Weston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Clint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Murphy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"70_CR1","first-page":"772","volume":"30","author":"J. Daniel","year":"1976","unstructured":"Daniel, J., Gragg, W.B., Kaufman, L., and Stewart, G.W., (1976),'Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization', Math. Comp., 30, 772\u2013795.","journal-title":"Math. Comp."},{"key":"70_CR2","unstructured":"Duff, I.S., Grimes, R.G., and Lewis, J.G., (1992),\u2019 User's Guide for the Harwell-Boeing Sparse Matrix Collection\u2019 (release I), available online ftp orion.cerfacs.fr."},{"key":"70_CR3","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"Golub, G., and Van Loan C.F., (1989),\u2019 Matrix Computations', John Hopkins University Press, London."},{"key":"70_CR4","unstructured":"Lehoucq, R., Sorensen, D.C., and Vu, P.A., (1994), SSAUPD: Fortran subroutines for solving large scale eigenvalue problems, Release 2.1, available from netlib@ornl.gov in the scalapack directory."},{"key":"70_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/imamat\/18.3.341","volume":"18","author":"C.C. Paige","year":"1976","unstructured":"Paige, C.C., (1976),\u2019 Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix', J. Inst. Math. Applic., 18, 341\u2013349.","journal-title":"J. Inst. Math. Applic."},{"key":"70_CR6","volume-title":"The Symmetric Eigenvalue Problem","author":"B.N. Parlett","year":"1980","unstructured":"Parlett, B.N., (1980),\u2019 The Symmetric Eigenvalue Problem', Prentice-Hall, Englewood Cliffs, N.J."},{"key":"70_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/S0025-5718-1979-0514820-3","volume":"33","author":"B.N. Parlett","year":"1979","unstructured":"Parlett, B.N., and Scott, D.S., (1979),\u2019 The Lanczos algorithm with selective orthogonalization', Math. Comput., 33, 217\u2013238.","journal-title":"Math. Comput."},{"key":"70_CR8","unstructured":"Rutter, J.D., (1994),\u2019 A Serial Implementation of Cuppen's Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem', LAPACK Working Note 69."},{"key":"70_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(84)90025-9","volume":"61","author":"H.D. Simon","year":"1984","unstructured":"Simon, H.D., (1984),\u2019 Analysis of the Symmetric Lanczos Algorithm with Reorthogonalization Methods',Linear Algebra Appl., 61, 101\u2013131.","journal-title":"Linear Algebra Appl."},{"key":"70_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"D.C. Sorensen","year":"1992","unstructured":"Sorensen, D.C., (1992),\u2019 Implicit Application of Polynomial Filters in a k-step Arnoldi Method',SIAM J. Matrix Anal. Appl., 13, 357\u2013385.","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing Industrial Computation and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62095-8_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:59Z","timestamp":1619573879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62095-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620952","9783540496434"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-62095-8_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}