{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T05:16:02Z","timestamp":1777353362502,"version":"3.51.4"},"reference-count":70,"publisher":"Walter de Gruyter GmbH","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper provides an overview of the new features of the finite element library\n                    <jats:monospace>deal.II<\/jats:monospace>\n                    , version 9.7.\n                  <\/jats:p>","DOI":"10.1515\/jnma-2025-0115","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:55:41Z","timestamp":1759132541000},"page":"403-415","source":"Crossref","is-referenced-by-count":6,"title":["The deal.II library, version 9.7"],"prefix":"10.1515","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8773-4901","authenticated-orcid":false,"given":"Daniel","family":"Arndt","sequence":"first","affiliation":[{"name":"Computational Coupled Physics Group, Computational Sciences and Engineering Division , Oak Ridge National Laboratory , 1 Bethel Valley Rd. , Oak Ridge , TN 37831 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2311-9402","authenticated-orcid":false,"given":"Wolfgang","family":"Bangerth","sequence":"additional","affiliation":[{"name":"Department of Mathematics , Colorado State University , Fort Collins , CO 80523 , USA"},{"name":"Department of Geosciences , Colorado State University , Fort Collins , CO 80523 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5911-2437","authenticated-orcid":false,"given":"Maximilian","family":"Bergbauer","sequence":"additional","affiliation":[{"name":"Institute for Computational Mechanics , Technical University of Munich , Boltzmannstr. 15, 85748 Garching bei M\u00fcnchen , Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6053-6542","authenticated-orcid":false,"given":"Bruno","family":"Blais","sequence":"additional","affiliation":[{"name":"Chemical Engineering High-Performance Analysis, Optimization and Simulation (CHAOS) Laboratory, Department of Chemical Engineering , Polytechnique Montr\u00e9al , PO Box 6079, Stn Centre-Ville , Montr\u00e9al , Qu\u00e9bec , H3C 3A7 , Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0984-793X","authenticated-orcid":false,"given":"Marc","family":"Fehling","sequence":"additional","affiliation":[{"name":"Department of Mathematical Analysis, Faculty of Mathematics and Physics , Charles University , Sokolovsk\u00e1 49\/83, 186\u200975 Prague 8 , Czech Republic"}]},{"given":"Rene","family":"Gassm\u00f6ller","sequence":"additional","affiliation":[{"name":"GEOMAR Helmholtz Centre for Ocean Research Kiel , 24148 Kiel , Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8137-3903","authenticated-orcid":false,"given":"Timo","family":"Heister","sequence":"additional","affiliation":[{"name":"School of Mathematical and Statistical Sciences , 2545 Clemson University , Clemson , SC , 29634 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5514-4683","authenticated-orcid":false,"given":"Luca","family":"Heltai","sequence":"additional","affiliation":[{"name":"Department of Mathematics , University of Pisa , Via Buonarroti 1\/c, 56127 Pisa , Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8406-835X","authenticated-orcid":false,"given":"Martin","family":"Kronbichler","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics , Ruhr University Bochum , Universit\u00e4tsstr. 150, 44780 Bochum , Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4960-5217","authenticated-orcid":false,"given":"Matthias","family":"Maier","sequence":"additional","affiliation":[{"name":"Department of Mathematics , Texas A&M University , 3368 TAMU , College Station , TX 77845 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2368-8533","authenticated-orcid":false,"given":"Peter","family":"Munch","sequence":"additional","affiliation":[{"name":"Institute of Mathematics , Technical University of Berlin , Berlin , Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7434-9024","authenticated-orcid":false,"given":"Sam","family":"Scheuerman","sequence":"additional","affiliation":[{"name":"Department of Mathematics , Colorado State University , Fort Collins , CO 80523 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5954-6313","authenticated-orcid":false,"given":"Bruno","family":"Turcksin","sequence":"additional","affiliation":[{"name":"Computational Coupled Physics Group, Computational Sciences and Engineering Division , Oak Ridge National Laboratory , 1 Bethel Valley Rd. , Oak Ridge , TN 37831 , USA"}]},{"given":"Siarhei","family":"Uzunbajakau","sequence":"additional","affiliation":[{"name":"CEM Books , Rotterdam , The Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8325-9186","authenticated-orcid":false,"given":"David","family":"Wells","sequence":"additional","affiliation":[{"name":"Department of Mathematics , University of North Carolina , Chapel Hill , NC 27516 , USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3644-3917","authenticated-orcid":false,"given":"Micha\u0142","family":"Wichrowski","sequence":"additional","affiliation":[{"name":"Interdisciplinary Center for Scientific Computing , Heidelberg University , Heidelberg , Germany"}]}],"member":"374","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"key":"2025121816075810361_j_jnma-2025-0115_ref_001","doi-asserted-by":"crossref","unstructured":"Y. Saad and M. H. Schultz, \u201cGMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems,\u201d SIAM J. Sci. Stat. Comput., vol.\u00a07, no.\u00a03, pp.\u00a0856\u2013869, 1986. https:\/\/doi.org\/10.1137\/0907058.","DOI":"10.1137\/0907058"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_002","doi-asserted-by":"crossref","unstructured":"C. Greif, T. Rees, and D. B. Szyld, \u201cGMRES with multiple preconditioners,\u201d SeMA J., vol.\u00a074, no.\u00a02, pp.\u00a0213\u2013231, 2016. https:\/\/doi.org\/10.1007\/s40324-016-0088-7.","DOI":"10.1007\/s40324-016-0088-7"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_003","doi-asserted-by":"crossref","unstructured":"W. Pazner, T. Kolev, and C. R. Dohrmann, \u201cLow-order preconditioning for the high-order finite element de Rham complex,\u201d SIAM J. Sci. Comput., vol.\u00a045, no.\u00a02, pp.\u00a0A675\u2013A702, 2023, https:\/\/doi.org\/10.1137\/22m1486534.","DOI":"10.1137\/22M1486534"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_004","doi-asserted-by":"crossref","unstructured":"M. Wichrowski, \u201cMatrix-free ghost penalty evaluation via tensor product factorization,\u201d arXiv preprint arXiv:2503.00246, 2025.","DOI":"10.2139\/ssrn.5189458"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_005","unstructured":"The deal.II developers, \u201cList of changes for deal.II release 9.7,\u201d [Online]. Available at: https:\/\/dealii.org\/developer\/doxygen\/deal.II\/changes_between_9_6_0_and_9_7_0.html."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_006","doi-asserted-by":"crossref","unstructured":"D. Arndt et al.., \u201cThe deal.II library, version 9.3,\u201d J. Numer. Math., vol.\u00a029, no.\u00a03, pp.\u00a0171\u2013186, 2021, https:\/\/doi.org\/10.1515\/jnma-2021-0081.","DOI":"10.1515\/jnma-2021-0081"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_007","doi-asserted-by":"crossref","unstructured":"M. Wichrowski, P. Munch, M. Kronbichler, and G. Kanschat, \u201cSmoothers with localized residual computations for geometric multigrid methods for higher-order finite elements,\u201d SIAM J. Sci. Comput., vol.\u00a047, no.\u00a03, pp.\u00a0B645\u2013B664, 2025. https:\/\/doi.org\/10.1137\/23M1625962.","DOI":"10.1137\/23M1625962"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_008","doi-asserted-by":"crossref","unstructured":"B. Turcksin, M. Kronbichler, and W. Bangerth, \u201cWorkStream \u2013 a design pattern for multicore-enabled finite element computations,\u201d ACM Trans. Math. Software, vol.\u00a043, no.\u00a01, pp.\u00a01\u201329, 2016, https:\/\/doi.org\/10.1145\/2851488.","DOI":"10.1145\/2851488"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_009","unstructured":"J. Reinders, Intel Threading Building Blocks, O\u2019Reilly Media, 2007."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_010","doi-asserted-by":"crossref","unstructured":"T.-W. Huang, D.-L. Lin, C.-X. Lin, and Y. Lin, \u201cTaskflow: a lightweight parallel and heterogeneous task graph computing system,\u201d IEEE Trans. Parallel Distr. Syst., vol.\u00a033, no.\u00a06, pp.\u00a01303\u20131320, 2021, https:\/\/doi.org\/10.1109\/tpds.2021.3104255.","DOI":"10.1109\/TPDS.2021.3104255"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_011","doi-asserted-by":"crossref","unstructured":"C. R. Trott et al.., \u201cKokkos 3: programming model extensions for the exascale era,\u201d IEEE Trans. Parallel Distr. Syst., vol.\u00a033, no.\u00a04, pp.\u00a0805\u2013817, 2022, https:\/\/doi.org\/10.1109\/tpds.2021.3097283.","DOI":"10.1109\/TPDS.2021.3097283"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_012","doi-asserted-by":"crossref","unstructured":"D. Arndt et al.., \u201cThe deal.II library, version 9.5,\u201d J. Numer. Math., vol.\u00a031, no.\u00a03, pp.\u00a0231\u2013246, 2023, https:\/\/doi.org\/10.1515\/jnma-2023-0089.","DOI":"10.1515\/jnma-2023-0089"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_013","doi-asserted-by":"crossref","unstructured":"P. R. Amestoy, I. S. Duff, J.-Y. L\u2019Excellent, and J. Koster, \u201cA fully asynchronous multifrontal solver using distributed dynamic scheduling,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a023, no.\u00a01, pp.\u00a015\u201341, 2001, https:\/\/doi.org\/10.1137\/s0895479899358194.","DOI":"10.1137\/S0895479899358194"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_014","doi-asserted-by":"crossref","unstructured":"S. Filippone and M. Colajanni, \u201cPSBLAS: a library for parallel linear algebra computation on sparse matrices,\u201d ACM Trans. Math. Software, vol.\u00a026, no.\u00a04, pp.\u00a0527\u2013550, 2000, https:\/\/doi.org\/10.1145\/365723.365732.","DOI":"10.1145\/365723.365732"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_015","unstructured":"A. Prokopenko, D. Lebrun-Grandi\u00e9, D. Arndt, and B. Turcksin, \u201cArborx 2.0,\u201d 2025 [Online]. Available at: https:\/\/www.osti.gov\/biblio\/code-154205."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_016","unstructured":"W. Bangerth, \u201cExperience converting a large mathematical software package written in C++ to C++20 modules,\u201d arXiv preprint, 2025, https:\/\/arxiv.org\/abs\/2506.21654."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_017","doi-asserted-by":"crossref","unstructured":"M. Bergbauer, P. Munch, W. A. Wall, and M. Kronbichler, \u201cHigh-performance matrix-free unfitted finite element operator evaluation,\u201d SIAM J. Sci. Comput., vol.\u00a047, no.\u00a03, pp.\u00a0B665\u2013B689, 2025, https:\/\/doi.org\/10.1137\/24m1653689.","DOI":"10.1137\/24M1653689"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_018","unstructured":"W. E. Brown, \u201cA proposal for the world\u2019s dumbest smart pointer, v4,\u201d 2014 [Online]. Available at: https:\/\/www.open-std.org\/jtc1\/sc22\/wg21\/docs\/papers\/2014\/n4282.pdf."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_019","doi-asserted-by":"crossref","unstructured":"W. Bangerth, R. Hartmann, and G. Kanschat, \u201cdeal.II \u2013 a general purpose object oriented finite element library,\u201d ACM Trans. Math. Software, vol.\u00a033, no.\u00a04, pp.\u00a024\u2013es, 2007, https:\/\/doi.org\/10.1145\/1268776.1268779.","DOI":"10.1145\/1268776.1268779"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_020","doi-asserted-by":"crossref","unstructured":"D. Arndt et al.., \u201cThe deal.II finite element library: design, features, and insights,\u201d Comput. Math. Appl., vol.\u00a081, pp.\u00a0407\u2013422, 2021, https:\/\/doi.org\/10.1016\/j.camwa.2020.02.022.","DOI":"10.1016\/j.camwa.2020.02.022"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_021","doi-asserted-by":"crossref","unstructured":"G. Kanschat, \u201cMulti-level methods for discontinuous Galerkin FEM on locally refined meshes,\u201d Comput. Struct., vol.\u00a082, no.\u00a028, pp.\u00a02437\u20132445, 2004, https:\/\/doi.org\/10.1016\/j.compstruc.2004.04.015.","DOI":"10.1016\/j.compstruc.2004.04.015"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_022","doi-asserted-by":"crossref","unstructured":"B. Janssen and G. Kanschat, \u201cAdaptive multilevel methods with local smoothing for H1- and Hcurl-conforming high order finite element methods,\u201d SIAM J. Sci. Comput., vol.\u00a033, no.\u00a04, pp.\u00a02095\u20132114, 2011, https:\/\/doi.org\/10.1137\/090778523.","DOI":"10.1137\/090778523"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_023","doi-asserted-by":"crossref","unstructured":"T. C. Clevenger, T. Heister, G. Kanschat, and M. Kronbichler, \u201cA flexible, parallel, adaptive geometric multigrid method for FEM,\u201d ACM Trans. Math. Software, vol.\u00a047, no.\u00a01, pp.\u00a01\u201327, 2021, https:\/\/doi.org\/10.1145\/3425193.","DOI":"10.1145\/3425193"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_024","doi-asserted-by":"crossref","unstructured":"P. Munch, T. Heister, L. Prieto Saavedra, and M. Kronbichler, \u201cEfficient distributed matrix-free multigrid methods on locally refined meshes for FEM computations,\u201d ACM Trans. Parallel Comput., vol.\u00a010, no.\u00a01, pp.\u00a01\u201338, 2023, https:\/\/doi.org\/10.1145\/3580314.","DOI":"10.1145\/3580314"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_034","doi-asserted-by":"crossref","unstructured":"N. Giuliani, A. Mola, and L. Heltai, \u201c\u03c0-BEM: a flexible parallel implementation for adaptive, geometry aware, and high order boundary element methods,\u201d Adv. Eng. Software, vol.\u00a0121, pp.\u00a039\u201358, 2018, https:\/\/doi.org\/10.1016\/j.advengsoft.2018.03.008.","DOI":"10.1016\/j.advengsoft.2018.03.008"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_025","doi-asserted-by":"crossref","unstructured":"W. Bangerth, C. Burstedde, T. Heister, and M. Kronbichler, \u201cAlgorithms and data structures for massively parallel generic adaptive finite element codes,\u201d ACM Trans. Math. Software, vol.\u00a038, no.\u00a02, pp.\u00a01\u201328, 2012, https:\/\/doi.org\/10.1145\/2049673.2049678.","DOI":"10.1145\/2049673.2049678"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_035","doi-asserted-by":"crossref","unstructured":"M. Maier, M. Bardelloni, and L. Heltai, \u201cLinearOperator \u2013 a generic, high-level expression syntax for linear algebra,\u201d Comput. Math. Appl., vol.\u00a072, no.\u00a01, pp.\u00a01\u201324, 2016, https:\/\/doi.org\/10.1016\/j.camwa.2016.04.024.","DOI":"10.1016\/j.camwa.2016.04.024"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_036","unstructured":"M. Maier, M. Bardelloni, and L. Heltai, \u201cLinearOperator benchmarks, version 1.0.0,\u201d Zenodo, 2016, https:\/\/doi.org\/10.5281\/zenodo.47202."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_026","doi-asserted-by":"crossref","unstructured":"W. Bangerth and O. Kayser-Herold, \u201cData structures and requirements for hp finite element software,\u201d ACM Trans. Math. Software, vol.\u00a036, no.\u00a01, pp.\u00a01\u201331, 2009, https:\/\/doi.org\/10.1145\/1486525.1486529.","DOI":"10.1145\/1486525.1486529"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_027","doi-asserted-by":"crossref","unstructured":"M. Fehling and W. Bangerth, \u201cAlgorithms for parallel generic hp-adaptive finite element software,\u201d ACM Trans. Math. Software, vol.\u00a049, no.\u00a03, pp.\u00a01\u201326, 2023, https:\/\/doi.org\/10.1145\/3603372.","DOI":"10.1145\/3603372"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_028","doi-asserted-by":"crossref","unstructured":"D. Davydov, T. Gerasimov, J.-P. Pelteret, and P. Steinmann, \u201cConvergence study of the h-adaptive PUM and the hp-adaptive FEM applied to eigenvalue problems in quantum mechanics,\u201d Adv. Model. Simul. Eng. Sci., vol.\u00a04, no.\u00a01, p.\u00a07, 2017, https:\/\/doi.org\/10.1186\/s40323-017-0093-0.","DOI":"10.1186\/s40323-017-0093-0"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_037","doi-asserted-by":"crossref","unstructured":"A. Sartori, N. Giuliani, M. Bardelloni, and L. Heltai, \u201cdeal2lkit: a toolkit library for high performance programming in deal.II,\u201d SoftwareX, vol.\u00a07, pp.\u00a0318\u2013327, 2018, https:\/\/doi.org\/10.1016\/j.softx.2018.09.004.","DOI":"10.1016\/j.softx.2018.09.004"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_029","doi-asserted-by":"crossref","unstructured":"M. Kronbichler and K. Kormann, \u201cA generic interface for parallel cell-based finite element operator application,\u201d Comput. Fluids, vol.\u00a063, pp.\u00a0135\u2013147, 2012, https:\/\/doi.org\/10.1016\/j.compfluid.2012.04.012.","DOI":"10.1016\/j.compfluid.2012.04.012"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_030","doi-asserted-by":"crossref","unstructured":"M. Kronbichler and K. Kormann, \u201cFast matrix-free evaluation of discontinuous Galerkin finite element operators,\u201d ACM Trans. Math. Software, vol.\u00a045, no.\u00a03, pp.\u00a01\u201340, 2019, https:\/\/doi.org\/10.1145\/3325864.","DOI":"10.1145\/3325864"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_038","doi-asserted-by":"crossref","unstructured":"R. Gassm\u00f6ller, H. Lokavarapu, E. Heien, E. G. Puckett, and W. Bangerth, \u201cFlexible and scalable particle-in-cell methods with adaptive mesh refinement for geodynamic computations,\u201d Geochem. Geophys. Geosyst., vol.\u00a019, no.\u00a09, pp.\u00a03596\u20133604, 2018. https:\/\/doi.org\/10.1029\/2018gc007508.","DOI":"10.1029\/2018GC007508"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_031","unstructured":"A. DeSimone, L. Heltai, and C. Manigrasso, \u201cTools for the solution of PDEs defined on curved manifolds with deal.II,\u201d SISSA, Tech. Rep. 42\/2009\/M, 2009."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_039","doi-asserted-by":"crossref","unstructured":"J. Zarestky, M. Bigler, M. Brazile, T. Lopes, and W. Bangerth, \u201cReflective writing supports metacognition and self-regulation in graduate computational science and engineering,\u201d Comput. Educ. Open, vol.\u00a03, pp.\u00a01\u201312, 2022. https:\/\/doi.org\/10.1016\/j.caeo.2022.100085.","DOI":"10.1016\/j.caeo.2022.100085"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_032","doi-asserted-by":"crossref","unstructured":"L. Heltai, W. Bangerth, M. Kronbichler, and A. Mola, \u201cPropagating geometry information to finite element computations,\u201d ACM Trans. Math. Software, vol.\u00a047, no.\u00a04, pp.\u00a01\u201330, 2021, https:\/\/doi.org\/10.1145\/3468428.","DOI":"10.1145\/3468428"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_033","unstructured":"L. Heltai and A. Mola, \u201cTowards the integration of CAD and FEM using open source libraries: a collection of deal.II manifold wrappers for the OpenCASCADE library,\u201d SISSA, Tech. Rep., 2015."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_040","doi-asserted-by":"crossref","unstructured":"A. Griewank, D. Juedes, and J. Utke, \u201cAlgorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C\/C++,\u201d ACM Trans. Math. Software, vol.\u00a022, no.\u00a02, pp.\u00a0131\u2013167, 1996, https:\/\/doi.org\/10.1145\/229473.229474.","DOI":"10.1145\/229473.229474"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_046","doi-asserted-by":"crossref","unstructured":"C. Geuzaine and J.-F. Remacle, \u201cGmsh: a 3-D finite element mesh generator with built-in pre-and post-processing facilities,\u201d Int. J. Numer. Methods Eng., vol.\u00a079, no.\u00a011, pp.\u00a01309\u20131331, 2009, https:\/\/doi.org\/10.1002\/nme.2579.","DOI":"10.1002\/nme.2579"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_055","unstructured":"\u201cmuparser: fast math parser library,\u201d Available at: https:\/\/beltoforion.de\/en\/muparser."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_063","doi-asserted-by":"crossref","unstructured":"D. J. Gardner, D. R. Reynolds, C. S. Woodward, and C. J. Balos, \u201cEnabling new flexibility in the sundials suite of nonlinear and differential\/algebraic equation solvers,\u201d ACM Trans. Math. Softw., vol.\u00a048, no.\u00a03, pp.\u00a01\u201324, 2022, https:\/\/doi.org\/10.1145\/3539801.","DOI":"10.1145\/3539801"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_047","unstructured":"M. Galassi et al.., GNU Scientific Library Reference Manual, 3rd ed. Network Theory Ltd., 2009."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_048","unstructured":"\u201cGSL: GNU scientific library,\u201d Available at: http:\/\/www.gnu.org\/software\/gsl."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_056","unstructured":"\u201cOpenCASCADE: open CASCADE technology, 3D modeling & numerical simulation,\u201d Available at: http:\/\/www.opencascade.org\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_064","unstructured":"\u201cSymEngine: fast symbolic manipulation library, written in C++,\u201d Available at: https:\/\/symengine.org\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_041","doi-asserted-by":"crossref","unstructured":"R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK Users\u2019 Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, Philadelphia, SIAM, 1998.","DOI":"10.1137\/1.9780898719628"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_049","doi-asserted-by":"crossref","unstructured":"H. Anzt et al.., \u201cGinkgo: a high performance numerical linear algebra library,\u201d J. Open Source Softw., vol.\u00a05, no.\u00a052, p.\u00a02260, 2020. https:\/\/doi.org\/10.21105\/joss.02260.","DOI":"10.21105\/joss.02260"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_050","doi-asserted-by":"crossref","unstructured":"H. Anzt et al.., \u201cGinkgo: a modern linear operator algebra framework for high performance computing,\u201d ACM Trans. Math. Software, vol.\u00a048, no.\u00a01, pp.\u00a01\u201333, 2022. https:\/\/doi.org\/10.1145\/3480935.","DOI":"10.1145\/3480935"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_057","doi-asserted-by":"crossref","unstructured":"C. Burstedde, L. C. Wilcox, and O. Ghattas, \u201cp4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees,\u201d SIAM J. Sci. Comput., vol.\u00a033, no.\u00a03, pp.\u00a01103\u20131133, 2011, https:\/\/doi.org\/10.1137\/100791634.","DOI":"10.1137\/100791634"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_042","unstructured":"T. Schulze et al.., \u201cOpen asset import library (assimp),\u201d 2021. Available at: https:\/\/github.com\/assimp\/assimp."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_051","unstructured":"The HDF Group, \u201cHierarchical data format, version 5,\u201d 2025. Available at: https:\/\/www.hdfgroup.org\/HDF5\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_058","unstructured":"S. Balay et al.., \u201cPETSc\/TAO users manual,\u201d Argonne National Laboratory, Tech. Rep. ANL-21\/39 \u2013 Revision 3.23, 2025."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_059","unstructured":"S. Balay et al.., \u201cPETSc web page,\u201d 2025 [Online]. Available at: https:\/\/petsc.org\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_043","unstructured":"E. Anderson et al.., LAPACK Users\u2019 Guide, 3rd ed. Philadelphia, PA, Society for Industrial and Applied Mathematics, 1999."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_065","unstructured":"M. Mayr et al.., \u201cTrilinos: enabling scientific computing across diverse hardware architectures at scale,\u201d arXiv preprint arXiv:2503.08126, 2025."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_066","unstructured":"The Trilinos Project Team, The Trilinos Project Website. Available at: https:\/\/trilinos.github.io\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_044","unstructured":"\u201cBoost C++ libraries,\u201d Available at: http:\/\/www.boost.org\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_052","unstructured":"\u201cMagic Enum C++,\u201d Available at: https:\/\/github.com\/Neargye\/magic_enum."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_060","unstructured":"A. Javeed, D. P. Kouri, D. Ridzal, and G. Von Winckel, \u201cGet ROL-ing: an introduction to Sandia\u2019s rapid optimization library,\u201d in 7th International Conference on Continuous Optimization, 2022 [Online]. Available at: https:\/\/www.osti.gov\/servlets\/purl\/2004204\/."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_067","doi-asserted-by":"crossref","unstructured":"T. A. Davis, \u201cAlgorithm 832: UMFPACK V4.3\u2013an unsymmetric-pattern multifrontal method,\u201d ACM Trans. Math. Software, vol. 30, no. 2, pp. 196\u2013199, 2004. https:\/\/doi.org\/10.1145\/992200.992206.","DOI":"10.1145\/992200.992206"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_045","unstructured":"The CGAL Project, CGAL User and Reference Manual, 6.0.1 ed. CGAL Editorial Board, 2024 [Online]. Available at: https:\/\/doc.cgal.org\/6.0.1\/Manual\/packages.html."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_053","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar, \u201cA fast and high quality multilevel scheme for partitioning irregular graphs,\u201d SIAM J. Sci. Comput., vol.\u00a020, no.\u00a01, pp.\u00a0359\u2013392, 1998, https:\/\/doi.org\/10.1137\/s1064827595287997.","DOI":"10.1137\/S1064827595287997"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_061","unstructured":"L. S. Blackford et al.., ScaLAPACK Users\u2019 Guide, Philadelphia, PA, Society for Industrial and Applied Mathematics, 1997."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_068","unstructured":"\u201cVTK,\u201d Available at: https:\/\/vtk.org."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_054","doi-asserted-by":"crossref","unstructured":"P. R. Amestoy, A. Buttari, J.-Y. L\u2019Excellent, and T. Mary, \u201cPerformance and scalability of the block low-rank multifrontal factorization on multicore architectures,\u201d ACM Trans. Math. Software, vol.\u00a045, no.\u00a01, pp.\u00a01\u201326, 2019, https:\/\/doi.org\/10.1145\/3242094.","DOI":"10.1145\/3242094"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_062","doi-asserted-by":"crossref","unstructured":"J. E. Roman, F. Alvarruiz, C. Campos, L. Dalcin, P. Jolivet, and A. Lamas Davi\u00f1a, \u201cImprovements to slepc in releases 3.14\u20133.18,\u201d ACM Trans. Math. Software, vol.\u00a049, no.\u00a03, pp.\u00a01\u201311, 2023, https:\/\/doi.org\/10.1145\/3603373.","DOI":"10.1145\/3603373"},{"key":"2025121816075810361_j_jnma-2025-0115_ref_069","unstructured":"\u201czlib,\u201d Available at: https:\/\/zlib.net."},{"key":"2025121816075810361_j_jnma-2025-0115_ref_070","doi-asserted-by":"crossref","unstructured":"P. C. Africa et al.., \u201cThe deal.II library, version 9.6,\u201d J. Numer. Math., vol.\u00a032, no.\u00a04, pp.\u00a0369\u2013380, 2024. https:\/\/doi.org\/10.1515\/jnma-2024-0137.","DOI":"10.1515\/jnma-2024-0137"}],"container-title":["Journal of Numerical Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2025-0115\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2025-0115\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T16:08:46Z","timestamp":1766074126000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2025-0115\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":70,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,2,27]]},"published-print":{"date-parts":[[2025,12,17]]}},"alternative-id":["10.1515\/jnma-2025-0115"],"URL":"https:\/\/doi.org\/10.1515\/jnma-2025-0115","relation":{},"ISSN":["1570-2820","1569-3953"],"issn-type":[{"value":"1570-2820","type":"print"},{"value":"1569-3953","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,29]]}}}