{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:09:27Z","timestamp":1742965767892,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_38","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"295-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ordering Unsymmetric Matrices into Bordered Block Diagonal Form for Parallel Processing"],"prefix":"10.1007","author":[{"given":"Y. F.","family":"Hu","sequence":"first","affiliation":[]},{"given":"K. C. F.","family":"Maguire","sequence":"additional","affiliation":[]},{"given":"R. J.","family":"Blake","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1177\/109434208900300303","volume":"3","author":"P.R. Amestoy","year":"1989","unstructured":"Amestoy P.R., Duff I.S.: Vectorization of a multiprocessor multifrontal code. International Journal of Supercomputer Applications and High Performance Computing 3 (1989) 41\u201359","journal-title":"International Journal of Supercomputer Applications and High Performance Computing"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S.T. Barnard","year":"1994","unstructured":"Barnard S.T., Simon H.D.: Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience6 (1994) 101\u2013117.","journal-title":"Concurrency: Practice and Experience"},{"key":"38_CR3","unstructured":"Camarda K.V., Stadtherr M.A.: Matrix ordering strategies for process engineering: graph partitioning algorithms for parallel computation, Computers & Chemical Engineering, to appear."},{"key":"38_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0030098","volume-title":"Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication","author":"U.V. \u00c7ataly\u00fcrek","year":"1996","unstructured":"\u00c7ataly\u00fcrek U.V., Aykanat C.: Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication. Lecture Notes in Computer Science 1117 (1996) 75\u201386."},{"key":"38_CR5","unstructured":"Choi H., Szyld D.B.: Application of threshold partitioning of sparse matrices to Markov chains. Technical Report 96-21, Dept. of Mathematics, Temple Univ., Philadephia, PA. (1996). Available from \nhttp:\/\/www.math.temple.edu\/_szyld\n\n."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/0098-1354(94)00081-6","volume":"19","author":"A.B. Coon","year":"1995","unstructured":"Coon A.B., M.A.Stadtherr M.A.: Generalized block-tridiagonal matrix orderings for parallel computation in-process flowsheeting. Computers & Chemical Engineering 19 (1995) 787\u2013805.","journal-title":"Computers & Chemical Engineering"},{"key":"38_CR7","unstructured":"Fiduccia C.M., Mattheyses R.M.: A linear time heuristic for improving network partitions. in Proc. 19th ACM-IEEE Design Automation Conf., Las Vegas, ACM (1982)."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/71.598277","volume":"5","author":"A. Gupta","year":"1997","unstructured":"Gupta A., Karypis G., Kumar V.: Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems 5 (1997) 502\u2013520.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"38_CR9","unstructured":"Hendrickson B., Leland R.: A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories, Allbuquerque, NM (1993)."},{"key":"38_CR10","unstructured":"Hendrickson B., Kolda T.G.: Partitioning Rectangular and Structurally Nonsymmetric Sparse Matrices for Parallel Processing, submitted to SIAM Journal of Scientific Computing, available from \nhttp:\/\/www.cs.sandia.gov\/_bahendr\/papers.html"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/0167-8191(94)90009-4","volume":"20","author":"Y. F. Hu","year":"1994","unstructured":"Hu Y. F., Blake R.J.: Numerical experiences with partitioning of unstructured meshes. Parallel Computing 20 (1994) 815\u2013829.","journal-title":"Parallel Computing"},{"key":"38_CR12","unstructured":"Hu Y.F., Maguire K.C.M., Blake R.J.: A multilevel unsymmetric matrix ordering algorithm for parallel process simulation, in prepartion."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis G., Kumar V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20 (1999) 359\u2013392.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan B.W., Lin S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. J. 49 (1970), pp. 291\u2013308.","journal-title":"Bell Systems Tech. J."},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1002\/aic.690430417","volume":"43","author":"J.U. Mallya","year":"1997","unstructured":"Mallya J.U., Zitney S.E., Choudhary S., Stadtherr M.A.: A parallel frontal solver for large-scale process simulation and optimization. AICHE JOURNAL 43 (1997) 1032\u20131040.","journal-title":"AICHE JOURNAL"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0098-1354(97)00088-4","volume":"21","author":"J.U. Mallya","year":"1997","unstructured":"Mallya J.U., Zitney S.E., Choudhary S., Stadtherr M.A.: A parallel block frontal solver for large scale process simulation: Reordering effects. Computers & Chemical Engineering 21 (1997) 439\u2013s444.","journal-title":"Computers & Chemical Engineering"},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1002\/aic.690380911","volume":"38","author":"J.A Vegeais","year":"1992","unstructured":"Vegeais J.A., Stadtherr M.A.: Parallel processing strategies for chemical process flowsheeting. AICHE Journal 38 (1992) 1399\u20131407.","journal-title":"AICHE Journal"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jpdc.1997.1407","volume":"47","author":"C. Walshaw","year":"1997","unstructured":"Walshaw C., Cross M., Everett M.G.: Parallel dynamic graph partitioning for adaptive unstructured meshes. Journal of Parallel and Distributed Computing 47 (1997) 102\u2013108.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/0098-1354(95)00198-0","volume":"20","author":"S.E. Zitney","year":"1996","unstructured":"Zitney S.E., Mallya J., Davis T.A., Stadtherr M.A.: Multifrontal vs frontal techniques for chemical process simulation on supercomputers Computers & Chemical Engineering 20 (1996) 641\u2013646.","journal-title":"Computers & Chemical Engineering"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:35:57Z","timestamp":1591875357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}