Locally-Verifiable Sufficient Conditions for Exactness of the Hierarchical B-spline Discrete de Rham Complex in $$\mathbb {R}^n$$

Abstract Given a domain $$\Omega \subset \mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Ω</mml:mi> <mml:mo>⊂</mml:mo> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> , the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on $$\Omega $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> , 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> is a hypercube, we thus require that the discrete subcomplex be exact. Focusing on such $$\Omega $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> , 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.

Authors

Institutions

Publication Details

Journal
Foundations of Computational Mathematics
Published
2024-12-04
DOI
https://doi.org/10.1007/s10208-024-09659-6
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Locally-Verifiable Sufficient Conditions for Exactness of the Hierarchical B-spline Discrete de Rham Complex in $$\mathbb {R}^n$$

Deepesh Toshniwal, Kendrick M. Shepherd
Foundations of Computational Mathematics
Advanced Numerical Analysis Techniques
article

Locally-Verifiable Sufficient Conditions for Exactness of the Hierarchical B-spline Discrete de Rham Complex in $$\mathbb {R}^n$$

Deepesh Toshniwal, Kendrick M. Shepherd
article en

Abstract

Abstract Given a domain $$\Omega \subset \mathbb {R}^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>Ω</mml:mi> <mml:mo>⊂</mml:mo> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> , the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on $$\Omega $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> , 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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> is a hypercube, we thus require that the discrete subcomplex be exact. Focusing on such $$\Omega $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Ω</mml:mi> </mml:math> , 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 MathematicsVol. 26(1)
Brigham Young University (US), Delft University of Technology (NL)
National Science Foundation, Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Openalex Percentile: Top 76%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.