{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T14:47:05Z","timestamp":1696949225714},"reference-count":37,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0167-8191(03)00101-7","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T13:11:36Z","timestamp":1063372296000},"page":"1237-1259","source":"Crossref","is-referenced-by-count":3,"title":["Parallel, multigrain iterative solvers for hiding network latencies on MPPs and networks of clusters"],"prefix":"10.1016","volume":"29","author":[{"given":"James R.","family":"McCombs","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Stathopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00101-7_BIB1","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0907058","article-title":"GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems","volume":"7","author":"Saad","year":"1986","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB2","article-title":"Lanczos algorithms for large symmetric eigenvalue computations","volume":"vol. 1","author":"Cullum","year":"1985"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB3","series-title":"Iterative Methods for Sparse Linear Systems","author":"Saad","year":"1996"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB4","series-title":"The Symmetric Eigenvalue Problem","author":"Parlett","year":"1998"},{"issue":"2","key":"10.1016\/S0167-8191(03)00101-7_BIB5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0914028","article-title":"A flexible inner\u2013outer preconditioned GMRES algorithm","volume":"14","author":"Saad","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0895479894270427","article-title":"A Jacobi\u2013Davidson iteration method for linear eigenvalue problems","volume":"17","author":"Sleijpen","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0024-3795(80)90247-5","article-title":"The block conjugate gradient algorithm and related methods","volume":"29","author":"O\u2019Leary","year":"1980","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB8","series-title":"Mathematical Software III","first-page":"361","article-title":"The block Lanczos method for computing eigenvalues","author":"Golub","year":"1977"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0377-0427(95)00198-0","article-title":"A hybrid block gmres method for nonsymmetric systems with multiple right-hand sides","volume":"66","author":"Simoncini","year":"1996","journal-title":"J. Comput. Appli. Math."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB10","series-title":"Numerical Linear Algebra for High Performance Computers","author":"Dongarra","year":"1998"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB11","series-title":"Scalable Parallel Computing","author":"Hwang","year":"1998"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB12","series-title":"The Grid\u2013\u2013Blueprint for a New Computing Infrastructure","year":"1998"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB13","series-title":"Computer Architecture A Quantitative Approach","author":"Hennessy","year":"1996"},{"issue":"6","key":"10.1016\/S0167-8191(03)00101-7_BIB14","doi-asserted-by":"crossref","first-page":"1776","DOI":"10.1137\/0728088","article-title":"s-step iterative methods for (non)symmetric (in)definite linear systems","volume":"28","author":"Chronopoulos","year":"1991","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"10.1016\/S0167-8191(03)00101-7_BIB15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0168-9274(95)00079-A","article-title":"Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers","volume":"18","author":"de Sturler","year":"1995","journal-title":"Appl. Numer. Math."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0165-6074(90)90325-4","article-title":"Vectorization and parallelization of the conjugate gradient algorithm on hypercube-connected vector processors","volume":"29","author":"Aykanat","year":"1990","journal-title":"Microprocess. Microprogram."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB17","series-title":"Supercomputing\u201993","first-page":"172","article-title":"Reducing synchronization on the parallel Davidson method for the large, sparse, eigenvalue problem","author":"Stathopoulos","year":"1993"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-8191(87)90013-5","article-title":"Parallel implementation of the block conjugate gradient algorithm","volume":"5","author":"O\u2019Leary","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB19","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB20","series-title":"1999 International Conference on Parallel and Distributed Processing Techniques and Applications","first-page":"2920","article-title":"A parallel, block, Jacobi\u2013Davidson implementation for solving large eigenproblems on coarse-grain environments","author":"Stathopoulos","year":"1999"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB21","series-title":"Proceedings of the Eleventh IEEE International Symposium on High Performance Distributed Computing","first-page":"143","article-title":"Multigrain parallelism for eigenvalue computations on networks of clusters","author":"McCombs","year":"2002"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB22","unstructured":"Y. Saad, K. Wu, Parallel SPARSe matrix LIBrary (P_SPARSLIB): the iterative solvers module, Tech. Rep. 94-008, Army High Performance Computing Research Center, Minneapolis, 1994"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","article-title":"A parallel algorithm for multilevel graph partitioning and sparse matrix ordering","volume":"48","author":"Karypis","year":"1998","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB24","doi-asserted-by":"crossref","unstructured":"J.R. McCombs, R.T. Mills, A. Stathopoulos, Dynamic load balancing of an iterative eigensolver on networks of heterogeneous clusters, in: Proceedings of the 17th International Parallel and Distributed Processing Symposium, 2003, on CDROM, ISBN 0-7695-1926-1","DOI":"10.1109\/IPDPS.2003.1213126"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB25","series-title":"Numerical Methods for Large Eigenvalue Problems","author":"Saad","year":"1992"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB26","doi-asserted-by":"crossref","unstructured":"M. Genseberger, G.L.G. Sleijpen, Alternative correction equations in the Jacobi\u2013Davidson method, Tech. Rep. 1073, Department of Mathematics, University of Utrecht, 1999","DOI":"10.1002\/(SICI)1099-1506(199904\/05)6:3<235::AID-NLA166>3.0.CO;2-8"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB27","unstructured":"B. Liu, Numerical algorithms in chemistry: algebraic methods, Tech. Rep. LBL-8158, Lawrence Berkeley National Laboratory, 1978"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB28","series-title":"Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide","year":"2000"},{"issue":"3","key":"10.1016\/S0167-8191(03)00101-7_BIB29","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/BF01731936","article-title":"Jacobi\u2013Davidson type methods for generalized eigenproblems and polynomial eigenproblems","volume":"36","author":"Sleijpen","year":"1996","journal-title":"BIT"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB30","unstructured":"A. Farazdel, G. Archondo-Callao, et al., Understanding and using the SP Switch, Tech. Rep. SG24-5161-00, IBM Corporation, 1999"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB31","unstructured":"RS\/6000 SP: SP Switch and SP Switch2 performance, Tech. Rep., IBM Corporation, June 2001"},{"issue":"7","key":"10.1016\/S0167-8191(03)00101-7_BIB32","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1016\/S0167-8191(01)00077-1","article-title":"Parallel preconditioning of a sparse eigensolver","volume":"27","author":"Bergamaschi","year":"2001","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB33","unstructured":"T. Davis, University of Florida Sparse Matrix Collection, NA Digest 97 (23) (1997)"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB34","unstructured":"Y. Saad, SPARSKIT: a basic tool kit for sparse matrix computations, Tech. Rep., Computer Science Department, University of Minnesota, Minneapolis, MN, version 2, June 1994"},{"key":"10.1016\/S0167-8191(03)00101-7_BIB35","unstructured":"E. Chow, ParaSails: parallel sparse approximate inverse (least-squares) preconditioner, Tech. Rep., Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, 2001"},{"issue":"1","key":"10.1016\/S0167-8191(03)00101-7_BIB36","doi-asserted-by":"crossref","DOI":"10.1137\/S1064827596300073","article-title":"Jacobi\u2013Davidson style QR and QZ algorithms for the partial reduction of matrix pencils","volume":"20","author":"Fokkema","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(03)00101-7_BIB37","unstructured":"LAM\/MPI Parallel Computing: LAM Version 6.5.2. Available from <http:\/\/www.lam-mpi.org\/6.5\/>, May 2003"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103001017?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103001017?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T06:21:43Z","timestamp":1550989303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103001017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0167819103001017"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00101-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}