{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T19:05:50Z","timestamp":1784228750580,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T00:00:00Z","timestamp":1784419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2110293"],"award-info":[{"award-number":["W911NF2110293"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS2335492, OAC2403239"],"award-info":[{"award-number":["IIS2335492, OAC2403239"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CSAIL Future of Data","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"FinTechAI programs","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"MIT\u2013IBM Watson AI Laboratory","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"Wistron Corporation","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"MIT Generative AI Impact Consortium","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"Toyota\u2013CSAIL Joint Research Center","award":["#"],"award-info":[{"award-number":["#"]}]},{"name":"Schmidt Sciences","award":["#"],"award-info":[{"award-number":["#"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,19]]},"DOI":"10.1145\/3799902.3811189","type":"proceedings-article","created":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T16:15:27Z","timestamp":1784218527000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2060-9596","authenticated-orcid":false,"given":"Behrooz","family":"Zarebavani","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1857-913X","authenticated-orcid":false,"given":"Ahmed H.","family":"Mahmoud","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4391-8877","authenticated-orcid":false,"given":"Ana","family":"Dodik","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9901-3454","authenticated-orcid":false,"given":"Changcheng","family":"Yuan","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1523-9199","authenticated-orcid":false,"given":"Serban D.","family":"Porumbescu","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6582-8237","authenticated-orcid":false,"given":"John D.","family":"Owens","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2719-8788","authenticated-orcid":false,"given":"Maryam","family":"Mehri Dehnavi","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada and NVIDIA, Seattle, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7701-7586","authenticated-orcid":false,"given":"Justin","family":"Solomon","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,19]]},"reference":[{"key":"e_1_3_3_2_2_1","doi-asserted-by":"publisher","unstructured":"Patrick\u00a0R. Amestoy Timothy\u00a0A. Davis and Iain\u00a0S. Duff. 1996. An Approximate Minimum Degree Ordering Algorithm. SIAM J. Matrix Anal. Appl. 17 4 (1996) 886\u2013905. 10.1137\/S0895479894278952","DOI":"10.1137\/S0895479894278952"},{"key":"e_1_3_3_2_3_1","unstructured":"Apple Inc.2025. Accelerate Framework. https:\/\/developer.apple.com\/documentation\/accelerate."},{"key":"e_1_3_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00052"},{"key":"e_1_3_3_2_5_1","doi-asserted-by":"publisher","unstructured":"Umberto Bertel\u00e8 and Francesco Brioschi. 1969. A New Algorithm for the Solution of the Secondary Optimization Problem in Non-Serial Dynamic Programming. J. Math. Anal. Appl. 27 3 (Sept. 1969) 565\u2013574. 10.1016\/0022-247x(69)90137-1","DOI":"10.1016\/0022-247x(69)90137-1"},{"key":"e_1_3_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/578817"},{"key":"e_1_3_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118601181"},{"key":"e_1_3_3_2_8_1","unstructured":"Yen-Hsiang Chang Ayd\u0131n Bulu\u00e7 and James Demmel. 2025. Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2504.17097 (2025)."},{"key":"e_1_3_3_2_9_1","doi-asserted-by":"publisher","unstructured":"Yanqing Chen Timothy\u00a0A. Davis William\u00a0W. Hager and Sivasankaran Rajamanickam. 2008. Algorithm 887: CHOLMOD Supernodal Sparse Cholesky Factorization and Update\/Downdate. ACM Trans. Math. Softw. 35 3 Article 22 (Oct. 2008) 14\u00a0pages. 10.1145\/1391989.1391995","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_3_2_10_1","doi-asserted-by":"publisher","unstructured":"Kazem Cheshmi Danny\u00a0M. Kaufman Shoaib Kamil and Maryam\u00a0Mehri Dehnavi. 2020. NASOQ: Numerically Accurate Sparsity-Oriented QP Solver. ACM Transactions on Graphics 39 4 (Aug. 2020) 96:1\u201396:17. 10.1145\/3386569.3392486","DOI":"10.1145\/3386569.3392486"},{"key":"e_1_3_3_2_11_1","doi-asserted-by":"publisher","unstructured":"C. Chevalier and F. Pellegrini. 2008. PT-SCOTCH: A tool for efficient parallel graph ordering. Parallel Comput. 34 6\u20138 (July 2008) 318\u2013331. 10.1016\/j.parco.2007.12.001","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"e_1_3_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.45"},{"key":"e_1_3_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"e_1_3_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311576"},{"key":"e_1_3_3_2_16_1","doi-asserted-by":"publisher","unstructured":"Alan George. 1973. Nested Dissection of a Regular Finite Element Mesh. SIAM J. Numer. Anal. 10 2 (1973) 345\u2013363. 10.1137\/0710032","DOI":"10.1137\/0710032"},{"key":"e_1_3_3_2_17_1","doi-asserted-by":"publisher","unstructured":"Alan George and Joseph W.\u00a0H. Liu. 1980. A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs. ACM Trans. Math. Software 6 3 (Sept. 1980) 337\u2013358. 10.1145\/355900.355906","DOI":"10.1145\/355900.355906"},{"key":"e_1_3_3_2_18_1","doi-asserted-by":"publisher","unstructured":"Philipp Herholz and Marc Alexa. 2018. Factor Once: Reusing Cholesky Factorizations on Sub-Meshes. ACM Transactions on Graphics 37 6 (Dec. 2018) 230:1\u2013230:9. 10.1145\/3272127.3275107","DOI":"10.1145\/3272127.3275107"},{"key":"e_1_3_3_2_19_1","doi-asserted-by":"publisher","unstructured":"Philipp Herholz and Olga Sorkine-Hornung. 2020. Sparse Cholesky Updates for Interactive Mesh Parameterization. ACM Transactions on Graphics 39 6 (Nov. 2020) 202:1\u2013202:14. 10.1145\/3414685.3417828","DOI":"10.1145\/3414685.3417828"},{"key":"e_1_3_3_2_20_1","unstructured":"Intel Corporation. 2025. Intel Math Kernel Library (MKL). https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/tools\/oneapi\/onemkl.html."},{"key":"e_1_3_3_2_21_1","doi-asserted-by":"crossref","unstructured":"Alec Jacobson Daniele Panozzo et\u00a0al. 2018. libigl: A simple C++ geometry processing library. https:\/\/libigl.github.io\/.","DOI":"10.1145\/3134472.3134497"},{"key":"e_1_3_3_2_22_1","unstructured":"George Karypis et\u00a0al. 2013a. METIS \u2014 Serial Graph Partitioning and Fill-reducing Matrix Ordering. http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview."},{"key":"e_1_3_3_2_23_1","unstructured":"George Karypis et\u00a0al. 2013b. ParMETIS \u2014 Parallel Graph Partitioning and Fill-reducing Matrix Ordering. http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/parmetis\/overview."},{"key":"e_1_3_3_2_24_1","doi-asserted-by":"publisher","unstructured":"George Karypis and Vipin Kumar. 1998. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20 1 (1998) 359\u2013392. 10.1137\/S1064827595287997","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_3_2_25_1","volume-title":"Three D Scans","author":"Laric Oliver","year":"2023","unstructured":"Oliver Laric. 2023. Three D Scans. https:\/\/threedscans.com\/."},{"key":"e_1_3_3_2_26_1","doi-asserted-by":"publisher","unstructured":"Richard\u00a0J. Lipton Donald\u00a0J. Rose and Robert\u00a0Endre Tarjan. 1979. Generalized Nested Dissection. SIAM J. Numer. Anal. 16 2 (1979) 346\u2013358. 10.1137\/0716027","DOI":"10.1137\/0716027"},{"key":"e_1_3_3_2_27_1","doi-asserted-by":"publisher","unstructured":"Stuart\u00a0P. Lloyd. 1982. Least Squares Quantization in PCM. IEEE Transactions on Information Theory 28 2 (March 1982) 129\u2013137. 10.1109\/TIT.1982.1056489","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_3_2_28_1","doi-asserted-by":"publisher","unstructured":"Ahmed\u00a0H. Mahmoud Serban\u00a0D. Porumbescu and John\u00a0D. Owens. 2021. RXMesh: A GPU Mesh Data Structure. ACM Transactions on Graphics 40 4 Article 104 (Aug. 2021) 16\u00a0pages. 10.1145\/3450626.3459748","DOI":"10.1145\/3450626.3459748"},{"key":"e_1_3_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1731309.1731335"},{"key":"e_1_3_3_2_30_1","unstructured":"NVIDIA Corporation. 2025. cuDSS: Release 0.7.1. https:\/\/developer.nvidia.com\/cudss\/."},{"key":"e_1_3_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63962-8_312-2"},{"key":"e_1_3_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-25820-6"},{"key":"e_1_3_3_2_33_1","doi-asserted-by":"publisher","unstructured":"Jason Smith and Scott Schaefer. 2015. Bijective Parameterization with Free Boundaries. ACM Trans. Graph. 34 4 Article 70 (July 2015) 9\u00a0pages. 10.1145\/2766947","DOI":"10.1145\/2766947"},{"key":"e_1_3_3_2_34_1","volume-title":"Smithsonian 3D Digitization","author":"Office Smithsonian Institution Digitization Program","year":"2023","unstructured":"Smithsonian Institution Digitization Program Office. 2023. Smithsonian 3D Digitization. https:\/\/3d.si.edu\/."},{"key":"e_1_3_3_2_35_1","doi-asserted-by":"publisher","unstructured":"William\u00a0F. Tinney and John\u00a0W. Walker. 1967. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55 11 (1967) 1801\u20131809. 10.1109\/PROC.1967.6011","DOI":"10.1109\/PROC.1967.6011"},{"key":"e_1_3_3_2_36_1","doi-asserted-by":"publisher","unstructured":"Mihalis Yannakakis. 1981. Computing the Minimum Fill-In is NP-Complete. SIAM Journal on Algebraic Discrete Methods 2 1 (1981) 77\u201379. 10.1137\/0602010","DOI":"10.1137\/0602010"},{"key":"e_1_3_3_2_37_1","doi-asserted-by":"publisher","unstructured":"Chang Yu Yi Xu Ye Kuang Yuanming Hu and Tiantian Liu. 2022. MeshTaichi: A Compiler for Efficient Mesh-based Operations. ACM Transactions on Graphics 41 6 Article 252 (Nov. 2022) 17\u00a0pages. 10.1145\/3550454.3555430","DOI":"10.1145\/3550454.3555430"},{"key":"e_1_3_3_2_38_1","doi-asserted-by":"publisher","unstructured":"Behrooz Zarebavani Danny M.\u00a0Kaufman David I.\u00a0W. Levin and Maryam Mehri\u00a0Dehnavi. 2025. Adaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns. ACM Transactions on Graphics 44 4 (July 2025) 119:1\u2013119:17. 10.1145\/3731179","DOI":"10.1145\/3731179"},{"key":"e_1_3_3_2_39_1","unstructured":"Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10 000 3D-Printing Models. CoRR (May 2016). arXiv:https:\/\/arXiv.org\/abs\/cs.GR\/1605.04797"}],"event":{"name":"SIGGRAPH Conference Papers '26: Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers","location":"Los Angeles CA USA","acronym":"SIGGRAPH Conference Papers '26","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3799902.3811189","content-type":"text\/html","content-version":"vor","intended-application":"syndication"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:18:27Z","timestamp":1784225907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3799902.3811189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,19]]},"references-count":38,"alternative-id":["10.1145\/3799902.3811189","10.1145\/3799902"],"URL":"https:\/\/doi.org\/10.1145\/3799902.3811189","relation":{},"subject":[],"published":{"date-parts":[[2026,7,19]]},"assertion":[{"value":"2026-07-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}