{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:04:30Z","timestamp":1751947470488,"version":"3.41.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1023\/a:1019199700323","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"217-240","source":"Crossref","is-referenced-by-count":12,"title":["Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems"],"prefix":"10.1007","volume":"20","author":[{"given":"Miloud","family":"Sadkane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger B.","family":"Sidje","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329299_CR1","volume-title":"LAPACK User's Guide","author":"E. Anderson","year":"1992","unstructured":"E. Anderson et al., LAPACK User's Guide (SIAM, Philadelphia, PA, 1992)."},{"issue":"8","key":"329299_CR2","first-page":"157","volume":"8","author":"G. Cisneros","year":"1986","unstructured":"G. Cisneros and C.F. Bunge, An improved computer program for eigenvectors and eigenvalues of large configuration interaction matrices using the algorithm of Davidson, Comput. Chemistry 8(8) (1986) 157\u2013160.","journal-title":"Comput. Chemistry"},{"issue":"1","key":"329299_CR3","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) (1994) 62\u201376.","journal-title":"SIAM J. Sci. Comput."},{"issue":"136","key":"329299_CR4","doi-asserted-by":"publisher","first-page":"772","DOI":"10.2307\/2005398","volume":"30","author":"J.W. Daniel","year":"1976","unstructured":"J.W. Daniel, W.B. Gragg, L. Kaufman and G.W. Stewart, Reorthogonalization and stable algorithms for updating the Gram\u2013Schmidt QR factorization, Math. Comp. 30(136) (1976) 772\u2013795.","journal-title":"Math. Comp."},{"key":"329299_CR5","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, Comput. Phys. 17 (1975) 87\u201394.","journal-title":"Comput. Phys."},{"key":"329299_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I.S. Duff","year":"1989","unstructured":"I.S. Duff, R.G. Grimes and J.G. Lewis, Sparse matrix test problems, ACM Trans. Math. Software 15 (1989) 1\u20134.","journal-title":"ACM Trans. Math. Software"},{"key":"329299_CR7","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd ed. (Johns Hopkins University Press, Baltimore, MD, 1989).","edition":"2nd ed."},{"issue":"2","key":"329299_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/355945.355948","volume":"7","author":"A. Jennings","year":"1981","unstructured":"A. Jennings and W.J. Stewart, A simultaneous iteration algorithm for real matrices, ACM Trans. Math. Software 7(2) (1981) 184\u2013198.","journal-title":"ACM Trans. Math. Software"},{"issue":"1","key":"329299_CR9","first-page":"6","volume":"21","author":"M.T. Jones","year":"1995","unstructured":"M.T. Jones and P.E. Plassmann, An improved incomplete Cholesky factorization, ACM Trans. Math. Software 21(1) (1995) 6\u201317.","journal-title":"ACM Trans. Math. Software"},{"issue":"1","key":"329299_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/200979.200986","volume":"21","author":"M.T. Jones","year":"1995","unstructured":"M.T. Jones and P.E. Plassmann, Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations, ACM Trans. Math. Software 21(1) (1995) 18\u201319.","journal-title":"ACM Trans. Math. Software"},{"key":"329299_CR11","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/0021-9991(84)90031-7","volume":"55","author":"N. Kosugi","year":"1984","unstructured":"N. Kosugi, Modification of the Liu\u2013Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix, Comput. Phys. 55 (1984) 426\u2013436.","journal-title":"Comput. Phys."},{"key":"329299_CR12","doi-asserted-by":"crossref","unstructured":"R.B. Lehoucq, Analysis and implementation of an implicitly restarted Arnoldi iteration, Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University (1995).","DOI":"10.21236\/ADA447560"},{"key":"329299_CR13","unstructured":"R.B. Lehoucq and J.A. Scott, An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices, Technical Report MCS-P547-1195, Argonne National Lab. (1996)."},{"key":"329299_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi methods","author":"R.B. Lehoucq","year":"1998","unstructured":"R.B. Lehoucq, D.C. Sorensen and C. Yang, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi methods (SIAM, Philadephia, PA, 1998)."},{"key":"329299_CR15","unstructured":"B. Liu, The simultaneous expansion for the solution of several of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices, in: Numerical Algorithms in Chemistry: Algebraic Method, eds. C. Moler and I. Shavitt (LBL-8158 Lawrence Berkeley Lab., 1978) pp. 49\u201353."},{"key":"329299_CR16","unstructured":"K. Meerbergen and M. Sadkane, Using Krylov approximations to the matrix exponential operator in Davidson's method, to appear in Appl. Numer. Math."},{"issue":"3","key":"329299_CR17","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1137\/0907054","volume":"7","author":"R.B. Morgan","year":"1986","unstructured":"R.B. Morgan and D.S. Scott, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Statist. Comput. 7(3) (1986) 817\u2013825.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329299_CR18","unstructured":"Y. Saad, SPARSKIT: a basic tool kit for sparse matrix computation, version 2, Technical Report, Computer Science Department, University of Minnesota, Minneapolis, MN."},{"key":"329299_CR19","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y. Saad","year":"1992","unstructured":"Y. Saad, Numerical Methods for Large Eigenvalue Problems, Algorithms and Architectures for Advanced Scientific Computing (Manchester University Press, Manchester, UK, 1992)."},{"key":"329299_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01388687","volume":"64","author":"M. Sadkane","year":"1993","unstructured":"M. Sadkane, Block Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math. 64 (1993) 195\u2013211.","journal-title":"Numer. Math."},{"issue":"1","key":"329299_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/285861.285868","volume":"24","author":"R.B. Sidje","year":"1998","unstructured":"R.B. Sidje, EXPOKIT: Software package for computing matrix exponentials, ACM Trans. Math. Software 24(1) (1998) 130\u2013156.","journal-title":"ACM Trans. Math. Software"},{"key":"329299_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"G.L.G. Sleijpen","year":"1996","unstructured":"G.L.G. Sleijpen and H.A. Van der Vorst, A Jacobi\u2013Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl. 17 (1996) 401\u2013425.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"329299_CR23","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"D.C. Sorensen","year":"1992","unstructured":"D.C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13 (1992) 357\u2013385.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"329299_CR24","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 eigenpairs of a large, sparse, real, symmetric matrix, Comput. Phys. Comm. 79(2) (1994) 268\u2013290.","journal-title":"Comput. Phys. Comm."},{"issue":"2","key":"329299_CR25","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 interaction calculations: a computer program based on a new derivation of the algorithm of Davidson, Comput. Chemistry 4(2) (1980) 55\u201360.","journal-title":"Comput. Chemistry"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019199700323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019199700323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019199700323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:36:16Z","timestamp":1751870176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019199700323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["329299"],"URL":"https:\/\/doi.org\/10.1023\/a:1019199700323","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}