{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T10:08:13Z","timestamp":1671185293604},"reference-count":48,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":[[1996,12]]},"DOI":"10.1016\/s0167-8191(96)00047-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"1291-1333","source":"Crossref","is-referenced-by-count":9,"title":["Solving large nonsymmetric sparse linear systems using MCSPARSE"],"prefix":"10.1016","volume":"22","author":[{"given":"K.A.","family":"Gallivan","sequence":"first","affiliation":[]},{"given":"B.A.","family":"Marsolf","sequence":"additional","affiliation":[]},{"given":"H.A.G.","family":"Wijshoff","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(96)00047-6_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-8191(89)90029-X","article-title":"Parallel pivoting combined with parallel reduction and fill-in control","volume":"11","author":"Alaghband","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB2","series-title":"Reliable Numerical Computation","first-page":"207","article-title":"Experiments in tearing large sparse systems","author":"Arioli","year":"1990"},{"issue":"5","key":"10.1016\/S0167-8191(96)00047-6_BIB3","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/0911053","article-title":"Use of the P4 and P5 algorithms for in-core factorization of sparse matrices","volume":"11","author":"Arioli","year":"1990","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"4","key":"10.1016\/S0167-8191(96)00047-6_BIB4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/109434208700100403","article-title":"Progress in sparse matrix methods for large linear systems on vector supercomputers","volume":"1","author":"Ashcraft","year":"1987","journal-title":"Internat. J. Supercomputing Appl."},{"issue":"5","key":"10.1016\/S0167-8191(96)00047-6_BIB5","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1137\/0711068","article-title":"Analysis of sparse elimination","volume":"11","author":"Bunch","year":"1974","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"10.1016\/S0167-8191(96)00047-6_BIB6","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TCS.1974.1083911","article-title":"The bordered triangular matrix and minimum essential sets of a digraph","volume":"21","author":"Cheung","year":"1974","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB7","article-title":"Users' guide for the unsymmetric pattern multifrontal package (UMFPACK, Version 1.1)","author":"Davis","year":"1995"},{"issue":"12","key":"10.1016\/S0167-8191(96)00047-6_BIB8","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1109\/12.9742","article-title":"Pairwise reduction for the direct, parallel solution of sparse unsymmetric sets of linear equations","volume":"37","author":"Davis","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-8191(96)00047-6_BIB9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0611028","article-title":"A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization","volume":"11","author":"Davis","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"10.1016\/S0167-8191(96)00047-6_BIB10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/355958.355968","article-title":"Algorithm 575, Permutations for a zero-free diagonal","volume":"7","author":"Duff","year":"1981","journal-title":"ACM Trans. Math. Software"},{"issue":"3","key":"10.1016\/S0167-8191(96)00047-6_BIB11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355958.355963","article-title":"On algorithms for obtaining a maximum transversal","volume":"7","author":"Duff","year":"1981","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-8191(86)90019-0","article-title":"Parallel implementation of multifrontal schemes","volume":"3","author":"Duff","year":"1986","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear equations","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"10.1016\/S0167-8191(96)00047-6_BIB14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0722022","article-title":"A structurally stable modification of Hellerman-Rarick's P4 algorithm for reordering unsymmetric sparse matrices","volume":"22","author":"Erisman","year":"1985","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"10.1016\/S0167-8191(96)00047-6_BIB15","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/0908054","article-title":"Evaluation of orderings for unsymmetric sparse matrices","volume":"8","author":"Erisman","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB16","series-title":"Proc. 4th SIAM Conf. on Parallel Proc. for Scient. Comp.","first-page":"23","article-title":"A large-grain parallel sparse system solver","author":"Gallivan","year":"1989"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0956-0521(90)90006-7","article-title":"Parallel hybrid sparse linear system solver","volume":"1","author":"Gallivan","year":"1990","journal-title":"Computing Systems in Engineering"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB18","series-title":"Proc. 1990 Internat. Conf. on Supercomputing","first-page":"132","article-title":"Solving general sparse linear systems using conjugate gradient-type methods","author":"Gallivan","year":"1990"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB19","series-title":"Proc. NATO ASI on Linear Systems","article-title":"Parallel direct method codes for general sparse matrices","author":"Gallivan","year":"1991"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB20","doi-asserted-by":"crossref","unstructured":"K.A. Gallivan, P.C. Hansen, T. Ostromsky and Z. Zlatev, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Computing 54 (1) 39\u201367.","DOI":"10.1007\/BF02238079"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB21","article-title":"mcsparse: A parallel sparse unsymmetric linear system solver","author":"Gallivan","year":"1991"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB22","series-title":"Proc. 8th ACM Internat. Conf. on Supercomputing","first-page":"419","article-title":"The parallel solution of nonsymmetric sparse linear systems using the H\u2217 reordering and an associated factorization","author":"Gallivan","year":"1994"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB23","article-title":"Numerical errors in sparse linear equations","author":"Gear","year":"1975"},{"issue":"2","key":"10.1016\/S0167-8191(96)00047-6_BIB24","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","article-title":"Nested dissection of a regular finite element mesh","volume":"10","author":"George","year":"1973","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"10.1016\/S0167-8191(96)00047-6_BIB25","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0717062","article-title":"An automatic one-way dissection algorithm for irregular finite element problems","volume":"17","author":"George","year":"1980","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB26","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","article-title":"An automatic nested dissection algorithm for irregular finite-element problems","volume":"15","author":"George","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB27","author":"George","year":"1981"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB28","series-title":"Tech. Rept. INF\/SCR-92-23","article-title":"Research on parallelizing the reordering phase of MCSPARSE, a large grain parallel sparse unsymmetric linear system solver","author":"Geschiere","year":"1992"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB29","article-title":"Exploiting large grain parallelism in a sparse direct linear system solver","author":"Geschiere","year":"1993"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB30","series-title":"Sparse Matrix Computations","article-title":"Finding the block lower triangular form of a matrix","author":"Gustavson","year":"1976"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB31","series-title":"Proc. 1995 Internat. Conf. on Parallel Processing, Volume 3: Algorithms and Applications","first-page":"42","article-title":"A distributed memory, multifrontal method for sequences of unsymmetric pattern matrices","author":"Hadfield","year":"1995"},{"issue":"10","key":"10.1016\/S0167-8191(96)00047-6_BIB32","doi-asserted-by":"crossref","first-page":"716","DOI":"10.2307\/2309562","article-title":"An algorithm for distinct representatives","volume":"63","author":"Hall","year":"1956","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB33","series-title":"Sparse Matrices and their Applications","article-title":"The partitioned preassigned pivot procedure (P4)","author":"Hellerman","year":"1972"},{"issue":"4","key":"10.1016\/S0167-8191(96)00047-6_BIB34","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An 5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0167-8191(96)00047-6_BIB35","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB36","series-title":"Proc. 3rd SIAM Conf. on Parallel Proc. for Scient. Comp.","first-page":"27","article-title":"Orderings for parallel sparse symmetric factorization","author":"Leiserson","year":"1987"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB37","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01593792","article-title":"Hierarchical partition \u2014 A new optimal pivoting algorithm","volume":"12","author":"Lin","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB38","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/S0167-8191(96)00047-6_BIB39","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/1034004","article-title":"The multifrontal method for sparse matrix solution: Theory and practice","volume":"34","author":"Liu","year":"1992","journal-title":"SIAM Review"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB40","series-title":"Tech. Rept. CSRD Report No. 1125","article-title":"Large grain parallel sparse system solver","author":"Marsolf","year":"1991"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB41","series-title":"Sparse Matrix Computations","first-page":"97","article-title":"An optimization problem arising from tearing methods","author":"Sangiovanni-Vincentelli","year":"1976"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB42","author":"Staff, The Cedar project","year":"1991"},{"issue":"2","key":"10.1016\/S0167-8191(96)00047-6_BIB43","first-page":"345","article-title":"Partitioning and tearing systems of equations","volume":"2","author":"Steward","year":"1965","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB44","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB45","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/0614059","article-title":"Parallel sparse LU decomposition on a mesh network of transputers","volume":"14","author":"van der Stappen","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB46","unstructured":"X. Wang, private communication."},{"key":"10.1016\/S0167-8191(96)00047-6_BIB47","article-title":"Symmetric orderings for unsymmetric sparse matrices","author":"Wijshoff","year":"1989"},{"key":"10.1016\/S0167-8191(96)00047-6_BIB48","article-title":"Preconditioned iterative solver for nonsymmetric linear systems","author":"Yang","year":"1994"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:31Z","timestamp":1555557631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196000476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":48,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0167819196000476"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00047-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}