Metraipolis › archive › dc_e437b679cdbb
Rotating bases for finite element exterior calculus: closed-form change of basis under vertex permutations — arXiv:2609.39511
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39511
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:17:09.666Z
- SHA-256 of the archived text
b36791e6cf53b3ef9f66a08a0666191715aacba0849ca1f8f4c0adc5cd6723ec- Stable URL of this page
https://metraipolis.com/documento/dc_e437b679cdbb
How to cite
Rotating bases for finite element exterior calculus: closed-form change of basis under vertex permutations — arXiv:2609.39511 — arXiv (en), https://arxiv.org/abs/2609.39511 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e437b679cdbb (Metraipolis archive dc_e437b679cdbb, sha256 b36791e6cf53b3ef9f66a08a0666191715aacba0849ca1f8f4c0adc5cd6723ec)
BibTeX
@misc{dce437b679cdbb,
title = {Rotating bases for finite element exterior calculus: closed-form change of basis under vertex permutations — arXiv:2609.39511},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39511},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e437b679cdbb; sha256 b36791e6cf53b3ef9f66a08a0666191715aacba0849ca1f8f4c0adc5cd6723ec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39511. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The geometrically decomposed bases of the polynomial differential form spaces $\mathcal{P}_r\Lambda^1$ and $\mathcal{P}_r^-\Lambda^1$ on a simplex are products of a barycentric scalar polynomial and a directional or Whitney 1-form. These bases depend on an ordering of the simplex vertices. On unstructured meshes, neighbouring cells need not agree on this ordering, making it non-trivial to achieve conformity in finite element software. Existing strategies compute degree-of-freedom transformation matrices numerically, or impose a global vertex ordering through face-bubble spaces or by preprocessing the mesh. We consider the standard basis of the $\mathcal{P}_r^-\Lambda^1$ (trimmed) space and introduce a new basis for the $\mathcal{P}_r\Lambda^1$ (full) space, for arbitrary polynomial order $r \geq 1$ and dimension $D \geq 2$, and prescribe their basis polynomials as shape functions. We show that the pullback of shape functions under the change of coordinates induced by an arbitrary vertex relabelling $\pi$ in the symmetric group $S_{D+1}$ admits a closed-form, combinatorial expression. For most basis functions this pullback is a single basis function of the relabelled ordering, up to sign. On an explicitly characterised "filter-hit" set, this pullback is a signed sum of at most $D$ (full space) or exactly two (trimmed space) relabelled basis functions. All coefficients are in $\{-1, +1\}$ for all $r$, $D$ and $\pi$. The inverse transformation is obtained by computing the formulas at $\pi^{-1}$, so no numerical inversion of a change-of-basis matrix is needed. Conforming assembly and evaluation on simplicial meshes with arbitrary vertex orderings reduce to index manipulation. Our results are compared with the study of relabelling-invariant bases of Berchenko-Kogan and Licht, and verified in an open-source Julia implementation in the this http URL library.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.39511 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:04:46.029Z dalla pagina https://arxiv.org/catchup/math.NA/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).