{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:10Z","timestamp":1725455710700},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648093"},{"type":"electronic","value":"9783540685333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0018526","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:30:21Z","timestamp":1131870621000},"page":"43-55","source":"Crossref","is-referenced-by-count":2,"title":["Thick-restart Lanczos method for symmetric eigenvalue problems"],"prefix":"10.1007","author":[{"given":"Kesheng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst D.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"W. E. Arnoldi","year":"1951","unstructured":"W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quarterly of Applied Mathematics, 9:17\u201329, 1951.","journal-title":"Quarterly of Applied Mathematics"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/BF01731924","volume":"36","author":"J. Baglama","year":"1996","unstructured":"J. Baglama, D. Calvetti, and L. Reichel. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT, 36:400\u2013421, 1996.","journal-title":"BIT"},{"key":"5_CR3","unstructured":"S. Balay, W. Gropp, L. C. McInnes, and B. Smith. PETSc 2.0 users manual. Technical Report ANL-95\/11, Mathematics and Computer Science Division, Argonne National Laboratory, 1995. Latest source code available at URL http:\/\/www.mcs.anl.gov\/petsc."},{"key":"5_CR4","unstructured":"A. Chapman and Y. Saad. Deflated and augmented Krylov subspace techniques. Technical Report UMSI 95\/181, Minnesota Supercomputing Institute, University of Minnesota, 1995."},{"key":"5_CR5","doi-asserted-by":"crossref","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:62\u201376, 1994.","journal-title":"SIAM J. Sci. Comput."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","volume":"17","author":"E. R. Davidson","year":"1975","unstructured":"Ernest R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys., 17:87\u201394, 1975.","journal-title":"J. Comput. Phys."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0010-4655(89)90147-1","volume":"53","author":"E. R. Davidson","year":"1989","unstructured":"Ernest R. Davidson. Super-matrix methods. Computer Physics Communications, 53:49\u201360, 1989.","journal-title":"Computer Physics Communications"},{"key":"5_CR8","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1996","unstructured":"G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD 21211, third edition, 1996.","edition":"third edition"},{"key":"5_CR9","series-title":"Technical Report SAND95-1559","doi-asserted-by":"crossref","DOI":"10.2172\/135550","volume-title":"AZTEC user's guide","author":"S. A. Hutchinson","year":"1995","unstructured":"S. A. Hutchinson, J. N. Shadid, and R. S. Tuminaro. AZTEC user's guide. Technical Report SAND95-1559, Massively parallel computing research laboratory, Sandia National Laboratories, Albuquerque, NM, 1995."},{"key":"5_CR10","series-title":"Technical Report ANL95\/48","volume-title":"Blocksolve95 users manual: scalable library software for parallel solution of sparse linear systems","author":"M. T. Jones","year":"1995","unstructured":"M. T. Jones and P. E. Plassmann. Blocksolve95 users manual: scalable library software for parallel solution of sparse linear systems. Technical Report ANL95\/48, Mathematics and Computer Science Division, Argonne national laboratory, Argonne, IL, 1995."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Richard B. Lehoucq. Analysis and implementation of an implicitly restarted Arnoldi iteration. PhD thesis, Rice University, 1995.","DOI":"10.21236\/ADA447560"},{"issue":"215","key":"5_CR12","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1090\/S0025-5718-96-00745-4","volume":"65","author":"R. B. Morgan","year":"1996","unstructured":"Ronald B. Morgan. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Mathematics of Computation, 65(215):1213\u20131230, July 1996.","journal-title":"Mathematics of Computation"},{"key":"5_CR13","volume-title":"The symmetric eigenvalue problem","author":"B. N. Parlett","year":"1980","unstructured":"Beresford N. Parlett. The symmetric eigenvalue problem. Prentice-Hall, Englewood Cliffs, NJ, 1980."},{"key":"5_CR14","unstructured":"Y. Saad. Analysis of augmented Krylov subspace techniques. Technical Report UMSI 95175, Minnesota Supercomputing Institute, University of Minnesota, 1995."},{"key":"5_CR15","unstructured":"Yousef Saad. Numerical Methods for Large Eigenvalue Problems. Manchester University Press, 1993."},{"key":"5_CR16","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Yousef Saad. Iterative Methods for Sparse Linear Systems. PWS publishing, Boston, MA, 1996."},{"issue":"2","key":"5_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01388686","volume":"64","author":"M. Sadkaue","year":"1993","unstructured":"Miloud Sadkaue. A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math., 64(2):181\u2013193, 1993.","journal-title":"Numer. Math."},{"key":"5_CR18","unstructured":"D. Sorensen, R. Lehoucq, P. Vu, and C. Yang. ARPACK: an implementation of the Implicitly Restarted Arnoldi iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix, 1995."},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"D. S. Sorensen","year":"1992","unstructured":"D. S. Sorensen. Implicit application of polynomial filters in a K-step Arnoldi method. SIAM J. Matrix Anal. Appl., 13(1):357\u2013385, 1992.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"5_CR20","volume-title":"Proceedings of Copper Mountain Conference on Iterative Methods","author":"A. Stathopoulos","year":"1996","unstructured":"A. Stathopoulos, Y. Saad, and K. Wu. Thick restarting of the Davidson method: an extension to implicit restarting. In T. Manteuffel, S. McCormick, L. Adams, S. Ashby, H. Elman, R. Freund, A. Greenbaum, S. Parter, P. Saylor, N. Trefethen, H. van der Vorst, H. Walker, and O. Wildlund, editors, Proceedings of Copper Mountain Conference on Iterative Methods, Copper Mountain, Colorado, 1996."},{"issue":"1","key":"5_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S1064827596304162","volume":"19","author":"A. Stathopoulos","year":"1998","unstructured":"A. Stathopoulos, Y. Saad, and K. Wu. Dynamic thick restarting of the Davidson and the implicitly restarted Arnoldi methods. SIAM J. Sci. Comput., 19(1):227\u2013245, 1998.","journal-title":"SIAM J. Sci. Comput."},{"key":"5_CR22","unstructured":"Kesheng Wu. Preconditioned Techniques for Large Eigenvalue Problems. PhD thesis, University of Minnesota, 1997. An updated version also appears as Technical Report TR97-038 at the Computer Science Department."},{"key":"5_CR23","unstructured":"Kesheng Wu and Horst Simon. Thick-restart Lauczos method for symmetric eigenvalue problems. Technical Report 41412, Lawrence Berkeley National Laboratory, 1998."}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:59:33Z","timestamp":1586552373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648093","9783540685333"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0018526","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}