Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.08172

Algorithm XXXX: Computation of finite element degree-of-freedom transformation matrices

Matthew W. Scroggs·Garth N. Wells
View original source ↗Read source document ↗Export metadata ↓

Abstract

The arithmetic intensity of algorithms for computing finite element operators increases with increasing polynomial degree. This has made high degree methods particularly attractive on modern CPU and GPU architectures, since on these architectures performance at low degree is limited (severely) by the available memory bandwidth and only a very small fraction of the floating point capacity of the processor is used. Higher degree methods can exploit a significantly greater fraction of the available compute power of modern architectures. However, whilst stable methods for computing high-degree finite element bases are well-established, there is no universal and automated algorithm for the efficient construction of the degree-of-freedom map for arbitrary degree elements. We address this with a new algorithm that can be used in computing degree-of-freedom maps for an arbitrary Ciarlet-type finite element using only the element's definition and properties of the reference cell, and without requiring a specific implementation for each element. This method is implemented in the library Basix, a component of the FEniCSx libraries. As well as allowing vast simplifications of parts of a codebase, the algorithm allows for new elements to be implemented with ease and has allowed us to support user-defined custom elements that a user can create at runtime without requiring the user to input any information about transformations required to construct a degree-of-freedom map.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew W. Scroggs, Garth N. Wells. 2026-07-09. Algorithm XXXX: Computation of finite element degree-of-freedom transformation matrices. https://arxiv.org/abs/2607.08172

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗