{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:37:15Z","timestamp":1725467835366},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649526"},{"type":"electronic","value":"9783540499206"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0057928","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"763-770","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A parallel solver for extreme eigenpairs"],"prefix":"10.1007","author":[{"given":"Leonardo","family":"Borges","sequence":"first","affiliation":[]},{"given":"Suely","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"94_CR1","volume-title":"LAPACK User\u2019s Guide","author":"E. Anderson","year":"1992","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK User\u2019s Guide. SIAM, Philadelphia, 1992."},{"key":"94_CR2","unstructured":"L. Borges and S. Oliveira. A parallel Davidson-type algorithm for several eigenvalues. Journal of Computational Physics. To appear."},{"key":"94_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0097-8485(86)85016-1","volume":"10","author":"G. Cisneros","year":"1986","unstructured":"G. Cisneros, M. Berrondo, and C. F. Brunge. DVDSON: A subroutine to evaluate selected sets of eigenvalues and eigenvectors of large symmetric matrices. Compu. Chem., 10:281\u2013291, 1986.","journal-title":"Compu. Chem."},{"key":"94_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0097-8485(84)85012-3","volume":"8","author":"G. Cisneros","year":"1984","unstructured":"G. Cisneros and C. F. Brunge. An improved computer program for eigenvector and eigenvalues of large configuration iteraction matrices using the algorithm of Davidson. Compu. Chem., 8:157\u2013160, 1984.","journal-title":"Compu. Chem."},{"issue":"1","key":"94_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0915004","volume":"15","author":"M. Crouzeix","year":"1994","unstructured":"M. Crouzeix, B. Philippe, and M. Sadkane. The Davidson method. SIAM J. Sci. Comput., 15(1):62\u201376, 1994.","journal-title":"SIAM J. Sci. Comput."},{"key":"94_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","volume":"17","author":"E. R. Davidson","year":"1975","unstructured":"E. R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comp. Phys., 17:87\u201394, 1975.","journal-title":"J. Comp. Phys."},{"key":"94_CR7","unstructured":"K. Maschhoff and D. Sorensen. A portable implementation of ARPACK for distributed memory parallel architectures. In Proceedings of Copper Mountain Conference on Iterative Methods, April 9\u201313 1996."},{"key":"94_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0021-9991(90)90177-3","volume":"90","author":"D. P. O\u2019Leary","year":"1990","unstructured":"D. P. O\u2019Leary and G. W. Stewart. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. J. Comp. Phys., 90:497\u2013505, 1990.","journal-title":"J. Comp. Phys."},{"key":"94_CR9","unstructured":"S. Oliveira. On the convergence rate of a preconditioned algorithm for eigenvalue problems. Submitted."},{"key":"94_CR10","doi-asserted-by":"crossref","unstructured":"S. Oliveira. A convergence proof of an iterative subspace method for eigenvalues problem. In F. Cucker and M. Shub, editors, Foundations of Computational Mathematics Selected Papers, pages 316\u2013325. Springer, January 1997. (selected).","DOI":"10.1007\/978-3-642-60539-0_25"},{"issue":"221","key":"94_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1090\/S0025-5718-98-00895-3","volume":"67","author":"S. Oliveira","year":"1998","unstructured":"S. Oliveira. A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form. Mathematics of Computation, 67(221):221\u2013235, January 1998.","journal-title":"Mathematics of Computation"},{"key":"94_CR12","volume-title":"Number 6 in Lecture Notes Comput. Sci.","author":"B. T. Smith","year":"1976","unstructured":"B. T. Smith, J. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler. Matrix eigensystem routines: EISPACK guide. Number 6 in Lecture Notes Comput. Sci. Springer-Verlag, Berlin, Heidelberg, New York, second edition, 1976.","edition":"second edition"},{"key":"94_CR13","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/0010-4655(94)90073-6","volume":"79","author":"A. Stathopoulos","year":"1994","unstructured":"A. Stathopoulos and C. F. Fischer. A Davidson program for finding a few selected extreme eigeinpairs of a large, sparse, real, symmetric matrix. Comp. Phys. Comm., 79:268\u2013290, 1994.","journal-title":"Comp. Phys. Comm."},{"key":"94_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0377-0427(95)00141-7","volume":"64","author":"A. Stathopoulos","year":"1995","unstructured":"A. Stathopoulos, Y. Saad, and C. F. Fisher. Robust preconditioning of large, sparse, symmetric eigenvalue problems. J. Comp. and Appl. Mathematics, 64:197\u2013215, 1995.","journal-title":"J. Comp. and Appl. Mathematics"},{"key":"94_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1177\/109434208900300404","volume":"3","author":"V. M. Umar","year":"1989","unstructured":"V. M. Umar and C. F. Fischer. Multitasking the Davidson algorithm for the large, sparse eigenvalue problem. Int. J. Supercomput. Appl., 3:28\u201353, 1989.","journal-title":"Int. J. Supercomput. Appl."},{"key":"94_CR16","doi-asserted-by":"crossref","unstructured":"R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, 1963.","DOI":"10.1063\/1.3051021"},{"key":"94_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0097-8485(80)80001-5","volume":"4","author":"J. Weber","year":"1980","unstructured":"J. Weber, R. Lacroix, and G. Wanner. The eigenvalue problem in configuration iteration calculations: A computer program based on a new derivation of the algorithm of Davidson. Compu. Chem., 4:55\u201360, 1980.","journal-title":"Compu. Chem."},{"key":"94_CR18","unstructured":"J. R. Westlake. A handbook of numerical matrix inversion and solution of linear equations. Wiley, 1968."},{"key":"94_CR19","unstructured":"D. M. Young. Iterative Solution of Large Linear Systems. Academic Press, 1971."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:17:27Z","timestamp":1587341847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0057928","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}