Systematic implementation of higher order Whitney forms in methods based on discrete exterior calculus

Abstract
We present a systematic way to implement higher order Whitney forms in numerical methods based on discrete exterior calculus. Given a simplicial mesh, we first refine the mesh into smaller simplices which can be used to define higher order Whitney forms. Cochains on this refined mesh can then be interpolated using higher order Whitney forms. Hence, when the refined mesh is used with methods based on discrete exterior calculus, the solution can be expressed as a higher order Whitney form. We present algorithms for the three required steps: refining the mesh, solving the coefficients of the interpolant, and evaluating the interpolant at a given point. With our algorithms, the order of the Whitney forms one wishes to use can be given as a parameter so that the same code covers all orders, which is a significant improvement on previous implementations. Our algorithms are applicable with all methods in which the degrees of freedom are integrals over mesh simplices — that is, when the solution is a cochain on a simplicial mesh. They can also be used when one simply wishes to approximate differential forms in finite-dimensional spaces. Numerical examples validate the generality of our algorithms.
Main Author
Format
Articles Research article
Published
2022
Series
Subjects
Publication in research information system
Publisher
Springer
The permanent address of the publication
https://urn.fi/URN:NBN:fi:jyu-202204262391Use this for linking
Review status
Peer reviewed
ISSN
1017-1398
DOI
https://doi.org/10.1007/s11075-022-01301-2
Language
English
Published in
Numerical Algorithms
Citation
License
CC BY 4.0Open Access
Additional information about funding
Open Access funding provided by University of Jyväskylä (JYU). University of Jyväskylä.
Copyright© 2022 the Authors

Share