{"title":"混合四面体网格上无矩阵有限元的基本数据结构","authors":"Nils Kohl, Daniel Bauer, Fabian Böhm, Ulrich Rüde","doi":"10.1080/17445760.2023.2266875","DOIUrl":null,"url":null,"abstract":"AbstractThis paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with 1.6⋅1011 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability.Keywords: Matrix-free finite elementshybrid tetrahedral gridsblock-structured gridsparallel data structures AcknowledgmentsThe authors gratefully acknowledge the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 https://i10git.cs.fau.de/hyteg/hyteg2 https://gauss-allianz.de/en/project/title/CoMPS3 https://www.nhr-verein.deAdditional informationFundingThe authors gratefully acknowledge funding through the joint BMBF project CoMPSFootnote2 (grant 16ME0647K). The authors would like to thank the NHR-Verein e.V.Footnote3 for supporting this work/project within the NHR Graduate School of National High Performance Computing (NHR). The Gauss Centre for Supercomputing e.V. funded this project by providing computing time on the GCS Supercomputer HPE Apollo Hawk at the High Performance Computing Center Stuttgart (grant TN17/44103). NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fundamental data structures for matrix-free finite elements on hybrid tetrahedral grids\",\"authors\":\"Nils Kohl, Daniel Bauer, Fabian Böhm, Ulrich Rüde\",\"doi\":\"10.1080/17445760.2023.2266875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AbstractThis paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with 1.6⋅1011 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability.Keywords: Matrix-free finite elementshybrid tetrahedral gridsblock-structured gridsparallel data structures AcknowledgmentsThe authors gratefully acknowledge the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 https://i10git.cs.fau.de/hyteg/hyteg2 https://gauss-allianz.de/en/project/title/CoMPS3 https://www.nhr-verein.deAdditional informationFundingThe authors gratefully acknowledge funding through the joint BMBF project CoMPSFootnote2 (grant 16ME0647K). The authors would like to thank the NHR-Verein e.V.Footnote3 for supporting this work/project within the NHR Graduate School of National High Performance Computing (NHR). The Gauss Centre for Supercomputing e.V. funded this project by providing computing time on the GCS Supercomputer HPE Apollo Hawk at the High Performance Computing Center Stuttgart (grant TN17/44103). NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683.\",\"PeriodicalId\":45411,\"journal\":{\"name\":\"International Journal of Parallel Emergent and Distributed Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Parallel Emergent and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17445760.2023.2266875\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2023.2266875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
摘要本文提出了在块结构混合四面体网格上实现无矩阵有限元方法的有效数据结构。它提供了从非结构化四面体粗网格的规则细化中出现的所有几何子对象的完整分类,并描述了有效的迭代模式和用于将系数映射到内存地址的分析线性化函数。这个基础可以实现快速、极端可扩展、无矩阵、迭代求解,特别是通过设计实现几何多网格方法。将其应用于富伽辽金离散化的变系数Stokes系统和用nsamdsamlec边元离散化的旋度-旋度问题,显示了实现的灵活性。最后,用无矩阵全多网格求解器解决了一个包含1.6⋅1011个(超过1000亿个)未知数、涉及32000多个过程的curl-curl问题,证明了它的极端可扩展性。关键词:无矩阵有限元混合四面体网格块结构网格并行数据结构致谢作者感谢Friedrich-Alexander-Universität Erlangen- n rnberg (FAU) Erlangen国家高性能计算中心(NHR@FAU)提供的科学支持和HPC资源。披露声明作者未报告潜在的利益冲突。作者感谢BMBF联合项目compsfootno2的资助(授权号16ME0647K)。作者要感谢NHR- verein e.v.对NHR国家高性能计算研究生院(NHR)内这项工作/项目的支持。高斯超级计算中心e.V.通过在斯图加特高性能计算中心的GCS超级计算机HPE阿波罗鹰上提供计算时间为该项目提供资金(拨款TN17/44103)。国家人权基金由联邦和巴伐利亚州当局提供。NHR@FAU硬件部分由德国研究基金会(DFG)资助- 440719683。
Fundamental data structures for matrix-free finite elements on hybrid tetrahedral grids
AbstractThis paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with 1.6⋅1011 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability.Keywords: Matrix-free finite elementshybrid tetrahedral gridsblock-structured gridsparallel data structures AcknowledgmentsThe authors gratefully acknowledge the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 https://i10git.cs.fau.de/hyteg/hyteg2 https://gauss-allianz.de/en/project/title/CoMPS3 https://www.nhr-verein.deAdditional informationFundingThe authors gratefully acknowledge funding through the joint BMBF project CoMPSFootnote2 (grant 16ME0647K). The authors would like to thank the NHR-Verein e.V.Footnote3 for supporting this work/project within the NHR Graduate School of National High Performance Computing (NHR). The Gauss Centre for Supercomputing e.V. funded this project by providing computing time on the GCS Supercomputer HPE Apollo Hawk at the High Performance Computing Center Stuttgart (grant TN17/44103). NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683.