{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:43:55Z","timestamp":1777452235617,"version":"3.51.4"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2016,6,15]]},"abstract":"<jats:p>\n            We present a structured parallel geometry-based multifrontal sparse solver using hierarchically semiseparable (HSS) representations and exploiting the inherent low-rank structures. Parallel strategies for nested dissection ordering (taking low rankness into account), symbolic factorization, and structured numerical factorization are shown. In particular, we demonstrate how to manage two layers of tree parallelism to integrate parallel HSS operations within the parallel multifrontal sparse factorization. Such a structured multifrontal factorization algorithm can be shown to have asymptotically lower complexities in both operation counts and memory than the conventional factorization algorithms for certain partial differential equations. We present numerical results from the solution of the anisotropic Helmholtz equations for seismic imaging, and demonstrate that our new solver was able to solve 3D problems up to 600\n            <jats:sup>3<\/jats:sup>\n            mesh size, with 216M degrees of freedom in the linear system. For this specific model problem, our solver is both faster and more memory efficient than a geometry-based multifrontal solver (which is further faster than general-purpose algebraic solvers such as MUMPS and SuperLU_DIST). For the 600\n            <jats:sup>3<\/jats:sup>\n            mesh size, the structured factors from our solver need about 5.9 times less memory.\n          <\/jats:p>","DOI":"10.1145\/2830569","type":"journal-article","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T12:11:38Z","timestamp":1462968698000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure"],"prefix":"10.1145","volume":"42","author":[{"given":"Shen","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Mathematics, Purdue University, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoye S.","family":"Li","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois-Henry","family":"Rouet","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianlin","family":"Xia","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Purdue University, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten V.","family":"De Hoop","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Purdue University, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/120903476"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.07.004"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2015.10.012"},{"key":"e_1_2_1_4_1","unstructured":"A. Aminfar and E. Darve. 2014. A fast sparse solver for finite-element matrices. CoRR abs\/1410.2697 (2014). http:\/\/arxiv.org\/abs\/1410.2697  A. Aminfar and E. Darve. 2014. A fast sparse solver for finite-element matrices. CoRR abs\/1410.2697 (2014). http:\/\/arxiv.org\/abs\/1410.2697"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-002-0445-6"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.008"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"L. S. Blackford J. Choi E. D'Azevedo J. Demmel I. Dhillon J. Dongarra S. Hammarling G. Henry A. Petitet K. Stanley D. Walker and R. C. Whaley. 1997. ScaLAPACK Users' Guide. SIAM Philadelphia.   L. S. Blackford J. Choi E. D'Azevedo J. Demmel I. Dhillon J. Dongarra S. Hammarling G. Henry A. Petitet K. Stanley D. Walker and R. C. Whaley. 1997. ScaLAPACK Users' Guide. SIAM Philadelphia.","DOI":"10.1137\/1.9780898719642"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0955-7997(02)00152-2"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479802405884"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/090775932"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479803436652"},{"key":"e_1_2_1_13_1","unstructured":"J. Dongarra and R. C. Whaley. 1997. A User's Guide to the BLACS v1.1. LAPACK Working Note #94. http:\/\/www.netlib.org\/blacs.  J. Dongarra and R. C. Whaley. 1997. A User's Guide to the BLACS v1.1. LAPACK Working Note #94. http:\/\/www.netlib.org\/blacs."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01300581"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20358"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2010.16"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s006070050015"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.21136\/MB.2002.134156"},{"key":"e_1_2_1_21_1","volume-title":"Lectures on Applied Mathematics","author":"Hackbusch W.","year":"1999","unstructured":"W. Hackbusch , B. Khoromskij , and S. A. Sauter . 2000. On H<sup>2<\/sup>-matrices . Lectures on Applied Mathematics ( Munich , 1999 ). Springer, Berlin (2000), 9--29. W. Hackbusch, B. Khoromskij, and S. A. Sauter. 2000. On H<sup>2<\/sup>-matrices. Lectures on Applied Mathematics (Munich, 1999). Springer, Berlin (2000), 9--29."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/333825.333827"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/120872735"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/779359.779361"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1034004"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-008-9240-6"},{"key":"e_1_2_1_28_1","volume-title":"A computer oriented geodetic data base","author":"Morton G. M.","year":"1966","unstructured":"G. M. Morton . 1966. A computer oriented geodetic data base ; and a new technique in file sequencing. Technical Report, Ottawa, Canada : IBM ( 1966 ). G. M. Morton. 1966. A computer oriented geodetic data base; and a new technique in file sequencing. Technical Report, Ottawa, Canada: IBM (1966)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386090"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-005-0107-z"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2010.07.027"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2478.2011.00982.x"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-246X.2012.05634.x"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848062"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/110827788"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/120867032"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1899353.1899373"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.691"},{"key":"e_1_2_1_40_1","unstructured":"Z. Xin J. Xia M. V. de Hoop S. Cauley and V. Balakrishnan. 2013. A structured multifrontal method for nonsymmetric sparse matrices and its applications. Purdue GMIG Report (April 2013).  Z. Xin J. Xia M. V. de Hoop S. Cauley and V. Balakrishnan. 2013. A structured multifrontal method for nonsymmetric sparse matrices and its applications. Purdue GMIG Report (April 2013)."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2830569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2830569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:00Z","timestamp":1750225380000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2830569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6,15]]}},"alternative-id":["10.1145\/2830569"],"URL":"https:\/\/doi.org\/10.1145\/2830569","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,10]]},"assertion":[{"value":"2013-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}