{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:15:42Z","timestamp":1780409742412,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031998713","type":"print"},{"value":"9783031998720","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99872-0_24","type":"book-chapter","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T11:08:54Z","timestamp":1755774534000},"page":"341-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniform Dense Blocking for\u00a0Efficient Sparse LU Factorization in\u00a0First-Principles Materials Simulation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8945-2722","authenticated-orcid":false,"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6487-3658","authenticated-orcid":false,"given":"Junshi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8994-6280","authenticated-orcid":false,"given":"Longsheng","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9097-6078","authenticated-orcid":false,"given":"Haijie","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5557-0729","authenticated-orcid":false,"given":"Dongdong","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5894-7130","authenticated-orcid":false,"given":"Yueqiang","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9006-4299","authenticated-orcid":false,"given":"Wentiao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihan","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3900-3722","authenticated-orcid":false,"given":"Hong","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996). https:\/\/doi.org\/10.1137\/S0895479894278952","DOI":"10.1137\/S0895479894278952"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 381\u2013388 (2004). https:\/\/doi.org\/10.1145\/1024074.1024081","DOI":"10.1145\/1024074.1024081"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Davis, T.A.: Algorithm 832: UMFPACK V4.3\u2014an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2), 196\u2013199 (2004). https:\/\/doi.org\/10.1145\/992200.992206","DOI":"10.1145\/992200.992206"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Davis, T.A.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2), 165\u2013195 (2004). https:\/\/doi.org\/10.1145\/992200.992205","DOI":"10.1145\/992200.992205"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 377\u2013380 (2004). https:\/\/doi.org\/10.1145\/1024074.1024080","DOI":"10.1145\/1024074.1024080"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 353\u2013376 (2004). https:\/\/doi.org\/10.1145\/1024074.1024079","DOI":"10.1145\/1024074.1024079"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1) (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Demmel, J.W., Eisenstat, S.C., Gilbert, J.R., Li, X.S., Liu, J.W.H.: A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20(3), 720\u2013755 (1999). https:\/\/doi.org\/10.1137\/S0895479895291765","DOI":"10.1137\/S0895479895291765"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Demmel, J.W., Gilbert, J.R., Li, X.S.: An asynchronous parallel supernodal algorithm for sparse gaussian elimination. SIAM J. Matrix Anal. Appl. 20(4), 915\u2013952 (1999). https:\/\/doi.org\/10.1137\/S0895479897317685","DOI":"10.1137\/S0895479897317685"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983). https:\/\/doi.org\/10.1145\/356044.356047","DOI":"10.1145\/356044.356047"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Eftekhari, A., Pasadakis, D., Bollh\u00f6fer, M., Scheidegger, S., Schenk, O.: Block-enhanced precision matrix estimation for large-scale datasets. J. Comput. Sci. 53 (2021). https:\/\/doi.org\/10.1016\/j.jocs.2021.101389","DOI":"10.1016\/j.jocs.2021.101389"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11222-022-10192-1","volume":"33","author":"L Gaedke-Merzh\u00e4user","year":"2023","unstructured":"Gaedke-Merzh\u00e4user, L., van Niekerk, J., Schenk, O., Rue, H.: Parallelized integrated nested Laplace approximations for fast Bayesian inference. Stat. Comput. 33(1), 25 (2023)","journal-title":"Stat. Comput."},{"key":"24_CR13","unstructured":"George, J.A.: Computer implementation of the finite element method. Ph.D. thesis, Stanford, CA, USA (1971). aAI7205916"},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Hu, W., et al.: 2.5 million-atom AB initio electronic-structure simulation of complex metallic heterostructures with DGDFT. In: SC22: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201313 (2022). https:\/\/doi.org\/10.1109\/SC41404.2022.00010","DOI":"10.1109\/SC41404.2022.00010"},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Hu, W., Lin, L., Yang, C.: DGDFT: a massively parallel method for large scale density functional theory calculations. J. Chem. Phys. 143(12) (2015). https:\/\/doi.org\/10.1063\/1.4931732. http:\/\/dx.doi.org\/10.1063\/1.4931732","DOI":"10.1063\/1.4931732"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 48(1), 71\u201395 (1998). https:\/\/doi.org\/10.1006\/jpdc.1997.1403","DOI":"10.1006\/jpdc.1997.1403"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Krainiuk, M., Goli, M., Pascuzzi, V.R.: oneAPI open-source math library interface. In: 2021 International Workshop on Performance, Portability and Productivity in HPC (P3HPC), pp. 22\u201332 (2021). https:\/\/doi.org\/10.1109\/P3HPC54578.2021.00006","DOI":"10.1109\/P3HPC54578.2021.00006"},{"key":"24_CR18","doi-asserted-by":"publisher","unstructured":"Li, X.S., Demmel, J.W.: Superlu_dist: a scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29(2), 110\u2013140 (2003). https:\/\/doi.org\/10.1145\/779359.779361","DOI":"10.1145\/779359.779361"},{"key":"24_CR19","doi-asserted-by":"publisher","unstructured":"Li, X.S., Lin, P., Liu, Y., Sao, P.: Newly released capabilities in the distributed-memory superlu sparse direct solver. ACM Trans. Math. Softw. 49(1) (2023). https:\/\/doi.org\/10.1145\/3577197","DOI":"10.1145\/3577197"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Lin, L., Chen, M., Yang, C., He, L.: Accelerating atomic orbital-based electronic structure calculation via pole expansion and selected inversion. J. Phys. Condensed Matter 25(29), 295501 (2013). https:\/\/doi.org\/10.1088\/0953-8984\/25\/29\/295501. https:\/\/dx.doi.org\/10.1088\/0953-8984\/25\/29\/295501","DOI":"10.1088\/0953-8984\/25\/29\/295501"},{"issue":"9","key":"24_CR21","doi-asserted-by":"publisher","first-page":"11256","DOI":"10.1109\/TPAMI.2023.3263969","volume":"45","author":"D Pasadakis","year":"2023","unstructured":"Pasadakis, D., Bollh\u00f6fer, M., Schenk, O.: Sparse quadratic approximation for graph learning. IEEE Trans. Pattern Anal. Mach. Intell. 45(9), 11256\u201311269 (2023). https:\/\/doi.org\/10.1109\/TPAMI.2023.3263969","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR22","doi-asserted-by":"publisher","unstructured":"Xianyi, Z., Qian, W., Yunquan, Z.: Model-driven level 3 BLAS performance optimization on Loongson 3A processor. In: Proceedings of the 2012 IEEE 18th International Conference on Parallel and Distributed Systems, ICPADS 2012, pp. 684\u2013691. IEEE Computer Society, USA (2012). https:\/\/doi.org\/10.1109\/ICPADS.2012.97","DOI":"10.1109\/ICPADS.2012.97"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99872-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:26:27Z","timestamp":1780406787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99872-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"ISBN":["9783031998713","9783031998720"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99872-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"22 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}