{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:32:31Z","timestamp":1726407151124},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401551"},{"type":"electronic","value":"9783540448396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44839-x_88","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T09:23:05Z","timestamp":1187256185000},"page":"840-847","source":"Crossref","is-referenced-by-count":0,"title":["Time-Memory Trade-Offs Using Sparse Matrix Methods for Large-Scale Eigenvalue Problems"],"prefix":"10.1007","author":[{"given":"Keita","family":"Teranishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"88_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK User\u2019s Guide","author":"E. Anderson","year":"1999","unstructured":"E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. M. Kcnncy, AND D. Sorensen, LAPACK User\u2019s Guide, third edition. SIAM, Philadelphia, 1999.","edition":"third edition"},{"key":"88_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719581","volume-title":"Templates for the Solution of Algebraic Eigenvalue Problems: A practical Guide","author":"Z. Bai","year":"2000","unstructured":"Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. Van der Vorst, editors. Templates for the Solution of Algebraic Eigenvalue Problems: A practical Guide SIAM, Philadelphia, 2000."},{"issue":"4","key":"88_CR3","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1145\/365723.365735","volume":"26","author":"C. H. Bischof","year":"2000","unstructured":"C. H. Bischof, B. Lang and X. Sun, A framework for symmetric band reduction. ACM Transactions on Mathematical Software Vol. 26 no. 4 pp. 581\u2013601, 2000.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"88_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK User\u2019s Guide","author":"L. S. Blackford","year":"1997","unstructured":"L. S. Blackford, J. Choi, A. Cleary, E. D\u2019Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley, ScaLAPACK User\u2019s Guide SIAM, Philadelphia, 1997."},{"key":"88_CR5","unstructured":"J. L. Barlow, Personal Communication"},{"key":"88_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"J. W. Demmel","year":"1997","unstructured":"J. W. Demmel, Applied Numerical Linear Algebra SIAM, Philadelphia, 1997."},{"key":"88_CR7","volume-title":"A New O (N2) Algorithm for the symmetric tridiagonal eigenvalue\/eigenvector problem","author":"I. S. Dhillon","year":"1997","unstructured":"I. S. Dhillon, A New O (N2) Algorithm for the symmetric tridiagonal eigenvalue\/eigenvector problem. PhD. Thesis, University of California, Berkeley, 1997."},{"key":"88_CR8","volume-title":"Direct Methods for sparse Matrices","author":"I. S. Duff","year":"1986","unstructured":"I. S. Duff, A. M. Erisman, and J. K. Raid, Direct Methods for sparse Matrices, Claredon Press, Oxford, 1986."},{"key":"88_CR9","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J. A. George","year":"1981","unstructured":"J. A. George, and J. W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Inc., Englewood Cliffs, NJ, 1981."},{"key":"88_CR10","volume-title":"Matrix Computations","author":"G. Golub","year":"1996","unstructured":"G. Golub and C. F. Van Loan, Matrix Computations, third edition, The Johns Hopkins University Press, Baltimore, MD, 1996.","edition":"third edition"},{"issue":"1","key":"88_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1137\/S0895479888151111","volume":"15","author":"R. G. Grimes","year":"1994","unstructured":"R. G. Grimes, J. G. Lewis, and H. D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J. Matrix Anal. Appl., Vol. 15, No. 1, pp. 228\u2013272, 1994.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"88_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895479892241287","volume":"16","author":"M. Gu","year":"1995","unstructured":"M. Gu and S. C. Eisenstat, A Divide-and-Conquer algorithm for the symmetric tridiagonal eigenproblem SIAM J. Matrix Anal. Appl. Vol. 16, No. 1 pp. 172\u2013191 1995.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"88_CR13","volume-title":"tech. rep.","author":"B. Hendrickson","year":"1996","unstructured":"B. Hendrickson and E. Rothberg, Improving the runtime and quality of nested dissection ordering, tech. rep., Sandia National Laboratories, Albuquerque, NM 87185, 1996."},{"issue":"1","key":"88_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/356068.356074","volume":"10","author":"L. Kaufman","year":"1984","unstructured":"L. Kaufman, Banded Eigenvalue Solvers on Vector Machines ACM Trans. Math. Software, Vol. 10, No. 1, pp. 73\u201386, 1984.","journal-title":"ACM Trans. Math. Software"},{"key":"88_CR15","volume-title":"tech. rep.","author":"G. Karypis","year":"1995","unstructured":"G. Karypis and V. Kumar, METIS: Unstructured graph partitioning and sparse matrix ordering system, tech. rep., Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995."},{"key":"88_CR16","unstructured":"R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK Users\u2019 Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods"},{"key":"88_CR17","doi-asserted-by":"crossref","first-page":"11577","DOI":"10.1103\/PhysRevB.50.11577","volume":"B50","author":"M. Menon","year":"1994","unstructured":"M. Menon and K.R. Subbaswamy, A Transferable Nonorthogonal Tight-Binding Scheme for Silicon, Phys. Rev. B50, 11577 (1994).","journal-title":"Phys. Rev."},{"issue":"5\/6","key":"88_CR18","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1006\/spmi.2000.0883","volume":"27","author":"M. Menon","year":"2000","unstructured":"M. Menon, R. Richter, P. Raghavan and K. Teranishi, Large Scale Quantum Mechanical Simulations of Carbon Wires, Superlattices and Microstructures, Vol. 27, No. 5\/6, pp. 577\u2013581, 2000.","journal-title":"Superlattices and Microstructures"},{"key":"88_CR19","unstructured":"Matrix Market \n                    http:\/\/math.nist.gov\/MatrixMarket\/"},{"issue":"4","key":"88_CR20","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1137\/S0895479897319313","volume":"20","author":"E. G.-Y. Ng","year":"1999","unstructured":"E. G.-Y. Ng and P. Raghavan, Performance of greedy ordering heuristics for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., Vol. 20, No. 4, pp. 902\u2013914, 1999.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"88_CR21","volume-title":"The Symmetric Eigenvalue Problem","author":"B. Parlett","year":"1980","unstructured":"B. Parlett., The Symmetric Eigenvalue Problem, Prentice Hall, Engle-wood Cliffs, NJ, (1980)."},{"key":"88_CR22","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0024-3795(99)00262-1","volume":"309","author":"B. N. Parlett","year":"2000","unstructured":"B. N. Parlett and I. S. Dhillon, Relatively Robust Representations for Symmetric Tridiagonals, Linear Algebra and its Applications, 309, pp. 121\u2013151, 2000.","journal-title":"Linear Algebra and its Applications"},{"key":"88_CR23","unstructured":"P. Raghavan, DSCPACK: Domain-Separator Codes for the parallel solution of sparse linear systems Technical Report CSE-02-004, Department of Computer Science and Engineering, The Pennsylvania State University, 2002."},{"key":"88_CR24","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"S. L. G. Slejipen","year":"1996","unstructured":"S. L. G. Slejipen and H. A. van der Vorst, A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl., Vol. 17, pp. 401\u2013425, 1996.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"88_CR25","volume-title":"Accelerating the Arnoldi Iteration: Theory and Practice","author":"C. Yang","year":"1998","unstructured":"C. Yang, Accelerating the Arnoldi Iteration: Theory and Practice Ph.D Thesis, Department of Computational and Applied Mathematics, Rice University, Houston, Jan. 1998."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2014 ICCSA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44839-X_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T02:54:39Z","timestamp":1550804079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44839-X_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401551","9783540448396"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44839-x_88","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}