中层次b样条离散de Rham复合体精确性的局部可验证充分条件 $$\mathbb {R}^n$$

IF 2.5 1区 数学 Q2 COMPUTER SCIENCE, THEORY & METHODS
Kendrick Shepherd, Deepesh Toshniwal
{"title":"中层次b样条离散de Rham复合体精确性的局部可验证充分条件 $$\\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":"{\"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}","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

摘要

给定一个定义域\(\Omega \subset \mathbb {R}^n\),在\(\Omega \)上定义的电磁学和流体力学问题的研究中自然会出现微分形式的de Rham复形,它的离散化有助于为这些问题建立稳定的数值方法。为了构造这样的稳定方法,一个关键的要求是保证离散子复与连续复是上同调等价的。当\(\Omega \)是超立方体时,我们要求离散子复是精确的。专注于\(\Omega \),我们从理论上分析了由分层b样条微分形式构建的离散de Rham复合体,即,离散微分形式是光滑样条并支持自适应细化-这些属性是实现精确和高效数值模拟的关键。我们提供了局部可验证的充分条件,保证离散样条复合体是精确的。数值试验支持了理论结果,讨论的例子包括满足我们规定条件的复合体和不符合规定条件的复合体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Locally-Verifiable Sufficient Conditions for Exactness of the Hierarchical B-spline Discrete de Rham Complex in $$\mathbb {R}^n$$

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
Foundations of Computational Mathematics 数学-计算机:理论方法
CiteScore
6.90
自引率
3.30%
发文量
46
审稿时长
>12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信