{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:04:49Z","timestamp":1751947489352,"version":"3.41.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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,9]]},"DOI":"10.1023\/a:1019161413952","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"109-118","source":"Crossref","is-referenced-by-count":2,"title":["A block-Lanczos method for large continuation problems"],"prefix":"10.1007","volume":"21","author":[{"given":"D.","family":"Calvetti","sequence":"first","affiliation":[]},{"given":"L.","family":"Reichel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"329329_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-0427(91)90157-F","volume":"38","author":"E.L. Allgower","year":"1991","unstructured":"E.L. Allgower, C.-S. Chien, K. Georg and C.-F. Wang, Conjugate gradient methods for continuation problems, J. Comput. Appl. Math. 38 (1991) 1\u201316.","journal-title":"J. Comput. Appl. Math."},{"key":"329329_CR2","first-page":"124","volume":"7","author":"J. Baglama","year":"1998","unstructured":"J. Baglama, D. Calvetti and L. Reichel, Fast Leja points, Elec. Trans. Numer. Anal. 7 (1998) 124\u2013140.","journal-title":"Elec. Trans. Numer. Anal."},{"key":"329329_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jcph.1998.6064","volume":"146","author":"J. Baglama","year":"1998","unstructured":"J. Baglama, D. Calvetti, L. Reichel and A. Ruttan, Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling, J. Comput. Phys. 146 (1998) 203\u2013226.","journal-title":"J. Comput. Phys."},{"key":"329329_CR4","first-page":"267","volume-title":"Proc. of the Cornelius Lanczos Internat. Centenary Conf.","author":"D. Calvetti","year":"1994","unstructured":"D. Calvetti, L. Reichel and Q. Zhang, Conjugate gradient algorithms for symmetric inconsistent linear systems, in: Proc. of the Cornelius Lanczos Internat. Centenary Conf., eds. J.D. Brown, M.T. Chu, D.C. Ellison and R.J. Plemmons (SIAM, Philadelphia, PA, 1994) pp. 267\u2013272."},{"key":"329329_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0377-0427(94)00104-4","volume":"62","author":"C.-S. Chien","year":"1995","unstructured":"C.-S. Chien, N.-H. Lu and Z.-L. Weng, Conjugate gradient methods for continuation problems II, J. Comput. Appl. Math. 62 (1995) 197\u2013216.","journal-title":"J. Comput. Appl. Math."},{"key":"329329_CR6","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.2307\/2006390","volume":"35","author":"T. Ericsson","year":"1980","unstructured":"T. Ericsson and A. Ruhe, The spectral transformation Lanczos method for the solution of large sparse symmetric generalized eigenvalue problems, Math. Comp. 35 (1980) 1251\u20131268.","journal-title":"Math. Comp."},{"key":"329329_CR7","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. (Johns Hopkins Univ. Press., Baltimore, MD, 1996).","edition":"3rd ed."},{"key":"329329_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1137\/S0895479888151111","volume":"15","author":"R.G. Grimes","year":"1994","unstructured":"R.G. Grimes, J.L. Lewis and H.D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. 15 (1994) 228\u2013272.","journal-title":"SIAM J. Matrix Anal."},{"key":"329329_CR9","volume-title":"Nonlinear eigenvalue problems \u2013 prediction of bifurcation points and branch switching","author":"J. Huitfeldt","year":"1991","unstructured":"J. Huitfeldt, Nonlinear eigenvalue problems \u2013 prediction of bifurcation points and branch switching, Report, Department of Computer Science, Chalmers University of Technology, G\u00f6teborg (1991)."},{"key":"329329_CR10","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/0911067","volume":"11","author":"J. Huitfeldt","year":"1990","unstructured":"J. Huitfeldt and A. Ruhe, A new algorithm for numerical path following applied to an example from hydrodynamics, SIAM J. Sci. Statist. Comput. 11 (1990) 1181\u20131192.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329329_CR11","volume-title":"Lectures on Numerical Methods in Bifurcation Problems","author":"H.B. Keller","year":"1987","unstructured":"H.B. Keller, Lectures on Numerical Methods in Bifurcation Problems (Springer, Berlin, 1987)."},{"key":"329329_CR12","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, Philadelphia, PA, 1998)."},{"key":"329329_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971163","volume-title":"The Symmetric Eigenvalue Problem","author":"B.N. Parlett","year":"1998","unstructured":"B.N. Parlett, The Symmetric Eigenvalue Problem (SIAM, Philadelphia, PA, 1998)."},{"key":"329329_CR14","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019161413952.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019161413952\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019161413952.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:13:56Z","timestamp":1751872436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019161413952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["329329"],"URL":"https:\/\/doi.org\/10.1023\/a:1019161413952","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}