{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:14:35Z","timestamp":1776122075935,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":[[1994,5]]},"DOI":"10.1016\/0167-8191(94)90004-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"753-773","source":"Crossref","is-referenced-by-count":53,"title":["Scalable iterative solution of sparse linear systems"],"prefix":"10.1016","volume":"20","author":[{"given":"Mark T","family":"Jones","sequence":"first","affiliation":[]},{"given":"Paul E","family":"Plassmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90004-3_BIB1","series-title":"Graph Theory","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0167-8191(94)90004-3_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(94)90004-3_BIB3","unstructured":"R. Butler and E. Lusk. Private communication, 1991."},{"key":"10.1016\/0167-8191(94)90004-3_BIB4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1137\/1031002","article-title":"Fourier analysis of iterative methods for elliptic boundary value problems","volume":"31","author":"Chan","year":"1989","journal-title":"SIAM Rev."},{"key":"10.1016\/0167-8191(94)90004-3_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","article-title":"Estimation of sparse Jacobian matrices and graph coloring problems","volume":"20","author":"Coleman","year":"1983","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8191(94)90004-3_BIB6","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/BF01932738","article-title":"The effect of ordering on preconditioned conjugate gradients","volume":"29","author":"Duff","year":"1989","journal-title":"BIT"},{"key":"10.1016\/0167-8191(94)90004-3_BIB7","series-title":"Performance of the Intel iPSC\/860 Hypercube","author":"Dunigan","year":"1990"},{"key":"10.1016\/0167-8191(94)90004-3_BIB8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0010-4655(89)90164-1","article-title":"Ordering techniques for the preconditioned conjugate gradient method on parallel computers","volume":"53","author":"Elman","year":"1989","journal-title":"Comput Phys. Commun."},{"key":"10.1016\/0167-8191(94)90004-3_BIB9","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(94)90004-3_BIB10","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(94)90004-3_BIB11","series-title":"Matrix Computations","author":"Golub","year":"1983"},{"key":"10.1016\/0167-8191(94)90004-3_BIB12","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/0909041","article-title":"Development of parallel methods for a 1024-processor hypercube","volume":"9","author":"Gustafson","year":"1988","journal-title":"SIAM J. Scientific and Statistical Comput."},{"key":"10.1016\/0167-8191(94)90004-3_BIB13","series-title":"Applied Iterative Methods","author":"Hageman","year":"1981"},{"key":"10.1016\/0167-8191(94)90004-3_BIB14","article-title":"Conjugate gradient methods for red\/black systems on vector computers","author":"Harrar","year":"1989"},{"key":"10.1016\/0167-8191(94)90004-3_BIB15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. National Bureau of Standards"},{"key":"10.1016\/0167-8191(94)90004-3_BIB16","series-title":"Proc. 5th Southeastern Conference on Combinatorics, Graph Theory, and Computing","first-page":"513","article-title":"Worst case behavior of graph coloring algorithms","author":"Johnson","year":"1974"},{"key":"10.1016\/0167-8191(94)90004-3_BIB17","series-title":"Parallel iterative solution of sparse systems using orderings from graph coloring heuristics","author":"Jones","year":"1990"},{"key":"10.1016\/0167-8191(94)90004-3_BIB18","first-page":"229","article-title":"An efficient parallel iterative solution of large sparse linear systems","volume":"Vol. 56","author":"Jones","year":"1993"},{"key":"10.1016\/0167-8191(94)90004-3_BIB19","series-title":"Proc. Copper Mountain Conf. on Iterative Methods","article-title":"The effect of many-color orderings on the convergence of iterative methods","author":"Jones","year":"1992"},{"key":"10.1016\/0167-8191(94)90004-3_BIB20","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","article-title":"A parallel graph coloring heuristic","volume":"14","author":"Jones","year":"1993","journal-title":"SIAM J. Scientific and Statistical Comput."},{"key":"10.1016\/0167-8191(94)90004-3_BIB21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/0726008","article-title":"A two-level four-color SOR method","volume":"26","author":"Kuo","year":"1989","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8191(94)90004-3_BIB22","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1090\/S0025-5718-1980-0559197-0","article-title":"An incomplete factorization technique for positive definite linear systems","volume":"34","author":"Manteuffel","year":"1980","journal-title":"Math. Computat."},{"key":"10.1016\/0167-8191(94)90004-3_BIB23","first-page":"148","article-title":"An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix","volume":"31","author":"Meijerink","year":"1977","journal-title":"Math. Computat."},{"key":"10.1016\/0167-8191(94)90004-3_BIB24","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0801034","article-title":"Orderings for conjugate gradient preconditioning","volume":"1","author":"Ortega","year":"1991","journal-title":"SIAM J. Optimization"},{"key":"10.1016\/0167-8191(94)90004-3_BIB25","series-title":"Vectorizing the conjugate gradient method","author":"Schreiber","year":"1982"},{"key":"10.1016\/0167-8191(94)90004-3_BIB26","series-title":"Finite Element Methods","author":"Schwarz","year":"1988"},{"key":"10.1016\/0167-8191(94)90004-3_BIB27","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1137\/0910071","article-title":"High performance preconditioning","volume":"10","author":"van der Vorst","year":"1989","journal-title":"SIAM J. Scientific Statistical Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:28:47Z","timestamp":1551068927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0167819194900043"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90004-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}