{"title":"Locally-Verifiable Sufficient Conditions for Exactness of the Hierarchical B-spline Discrete de Rham Complex in $$\\mathbb {R}^n$$","authors":"Kendrick Shepherd, Deepesh Toshniwal","doi":"10.1007/s10208-024-09659-6","DOIUrl":null,"url":null,"abstract":"<p>Given a domain <span>\\(\\Omega \\subset \\mathbb {R}^n\\)</span>, the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on <span>\\(\\Omega \\)</span>, and its discretization helps build stable numerical methods for such problems. For constructing such stable methods, one critical requirement is ensuring that the discrete subcomplex is cohomologically equivalent to the continuous complex. When <span>\\(\\Omega \\)</span> is a hypercube, we thus require that the discrete subcomplex be exact. Focusing on such <span>\\(\\Omega \\)</span>, we theoretically analyze the discrete de Rham complex built from hierarchical B-spline differential forms, i.e., the discrete differential forms are smooth splines and support adaptive refinements—these properties are key to enabling accurate and efficient numerical simulations. We provide locally-verifiable sufficient conditions that ensure that the discrete spline complex is exact. Numerical tests are presented to support the theoretical results, and the examples discussed include complexes that satisfy our prescribed conditions as well as those that violate them.</p>","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"82 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10208-024-09659-6","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Given a domain \(\Omega \subset \mathbb {R}^n\), the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on \(\Omega \), and its discretization helps build stable numerical methods for such problems. For constructing such stable methods, one critical requirement is ensuring that the discrete subcomplex is cohomologically equivalent to the continuous complex. When \(\Omega \) is a hypercube, we thus require that the discrete subcomplex be exact. Focusing on such \(\Omega \), we theoretically analyze the discrete de Rham complex built from hierarchical B-spline differential forms, i.e., the discrete differential forms are smooth splines and support adaptive refinements—these properties are key to enabling accurate and efficient numerical simulations. We provide locally-verifiable sufficient conditions that ensure that the discrete spline complex is exact. Numerical tests are presented to support the theoretical results, and the examples discussed include complexes that satisfy our prescribed conditions as well as those that violate them.
期刊介绍:
Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer.
With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles.
The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.