Towards nonuniform distributions of unisolvent weights for high-order Whitney edge elements

We propose to extend results on the interpolation theory for scalar functions to the case of differential k-forms. More precisely, we consider the interpolation of fields in Pr-Λk(T)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal P}^-_r \varLambda ^k(T)$$\end{document}, the finite element spaces of trimmed polynomial k-forms of arbitrary degree r≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r \ge 1$$\end{document}, from their weights, namely their integrals on k-chains. These integrals have a clear physical interpretation, such as circulations along curves, fluxes across surfaces, densities in volumes, depending on the value of k. In this work, for k=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=1$$\end{document}, we rely on the flexibility of the weights with respect to their geometrical support, to study different sets of 1-chains in T for a high order interpolation of differential 1-forms, constructed starting from “good” sets of nodes for a high order multi-variate polynomial representation of scalar fields, namely 0-forms. We analyse the growth of the generalized Lebesgue constant with the degree r and preliminary numerical results for edge elements support the nonuniform choice, in agreement with the well-known nodal case.


Introduction
New degrees of freedom, called weights to distinguish them from the classical moments introduced in [18], have been firstly proposed in [20] for the interpolation, on simplicial meshes, of physical fields, intended as differential k-forms, in Whitney finite element spaces of high polynomial degree r ≥ 1 (see, [3,6]). These weights are integrals of the field under consideration on a distribution of small k-simplices, that are particular subsimplices of dimension k in each element of the mesh. In [1] we have generalized this construction and now we develop that idea to establish how to select minimal and unisolvent sets of such small simplices as supports of the weights. This new methodology yields a flexibility, in the choice of the small simplices, that opens the way to nonuniform distributions, where the term nonuniform needs some care for k ≠ 0 and k ≠ n , being n the ambient dimension. The quality of the interpolation on uniform and nonuniform distributions of small k-simplices can be analysed in terms of the generalized Lebesgue constant [2].
Finite element spaces extending Whitney forms to higher degrees are widely used for discretizing physical balance laws in electromagnetism, fluid dynamics or elasticity. The degrees of freedom (dofs) associated with Whitney differential forms have a direct physical relevance. When considering polynomial interpolation of higher degree, dofs can be chosen in different ways. In [18] and its extension [15] (see also [16]), higher moments are used. They are also considered in the general framework of the finite element exterior calculus [3]. In [20], the localization issue has been addressed, namely, the relationship between dofs and measurable quantities (such as circulations, fluxes, densities) for the field they are related with. In the framework of high order Whitney finite element spaces, integrals on suitable subsimplices of the mesh are a valid alternative as dofs to the classical moments. Their definition is based on the introduction of the small simplices, that are subsimplices resulting from homothetic contractions of the elements of the mesh 1 . New dofs are then the weights, integrals of a k-form on these small k-simplices. The weights make the connection between physics and geometry: the concept of small k-simplex was born from the necessity of extending to r > 1 the geometrical construction proposed for r = 1 by Weil-Whitney in a context other than finite elements but more related with algebraic cohomology and the proof of the de Rham's theorem (see [23,24]). Understanding and generalizing this construction has been fundamental to provide explicit bases for high order finite element spaces involved in the discretization of problems from electromagnetism and other areas of physics.
The concept of weight on a small k-simplex represents an important theoretical achievement to see that it is indeed possible to extend standard results of polynomial interpolation theory to k-forms with k > 0 . In the particular case of 0-forms the Whitney finite elements are in fact the Lagrange ones and the integrals on the small 0-simplices are the dofs used in the classical description of the Lagrange finite elements (see e.g. [8]), namely the values at the points of the principal lattices of the elements of the mesh. The weights of k-forms on small k-simplices for k > 0 , can be intended as a generalization of the values at nodes (small 0-simplices) of continuous scalar functions (differential 0-forms). It is well-known that the Lagrange interpolation at uniformly distributed points in the mesh elements can yield a poor approximation as soon as the polynomial degree increases, even when the interpolated function is rather smooth [4]. This is due to a rapid increase, with the approximation degree, of the Lebesgue constant that influences the sharpness of the bound on the interpolation error. In other words, the Lebesgue constant measures how the interpolating polynomial is close to or far from the best fit. For this reason there have been several attempts in the literature (see [11,19,21,22] and the references therein) to produce nodal sets in a triangle or tetrahedron using direct (with explicit formula) and indirect (undergoing an optimization procedure) methods, satisfying criteria of low computational complexity and minimization of the Lebesgue constant. It naturally arises the following question: "Is it possible to do the same for k > 0 ?". In other words: "How small k-simplices, 0 < k < n , should be distributed in a triangle or a tetrahedron in order to interpolate differential k-forms by trimmed polynomial ones in a way that remains stable with the growth of the degree r ?" In this work, we provide an answer to the question when k = 1 by generalizing the construction of nonuniform distributions of nodes to that of small edges. We first detail how to construct unisolvent and minimal sets of small edges with ending points in distributions of nodes that are well-known in the literature 2 . We then exploit this flexibility to analyse, for the weights on these new sets of small edges, the growth of the generalized Lebesgue constant introduced in [2] when increasing the polynomial degree. The behavior of the generalized Lebesgue constant will state the quality of the polynomial interpolation of 1-forms at the new nonuniform distributions of the small 1-simplices in the mesh. We will see that small changes on the data give rise to small changes on the interpolating form if the Lebesgue constant is small. This constant plays the role of the condition number for the interpolation problem.
The paper is organized as follows. In Sect. 2 we recall few notations and basic notions of polynomial differential forms and of the role of the Lebesgue constant in the classical interpolation theory. In Sect. 3, the notions of Vandermonde matrix and Lebesgue constant are presented for k > 0 . In Sect. 4 we describe how to generate sets of 1-simplices supporting weights for trimmed polynomial 1-forms that are unisolvent associated with classical choices of interpolation nodes, namely the uniform, the symmetrised Lobatto and warp & blend distributions. Section 5 starts with 2 The reason is twofold. On the one side, we will be able to compare the results for k = 1 to those for k = 0 , available in the cited literature. On the other hand, we can approximate simultaneously, if necessary, a field, say for example the electric field , for which the weights on the small edges are physically meaningful, and its potential, a scalar function such that = −∇ , starting from its values at the nodes extremities of the considered small edges. Finding a minimal and unisolvent distribution of small edges that optimizes a chosen quantity or property goes beyond the purpose of the present work. the adopted algorithm to compute the generalized Lebesgue constant and ends with a numerical comparison of the behavior, when increasing the polynomial degree, of such a constant associated with the considered families of dofs in two and three dimensions. In Sect. 6 we discuss the dependence on the shape of the element of the generalized Lebesgue constant for k = 1 . In Sect. 7 we analyse the stability of the interpolation for k = 1 with respect to perturbations on the data, i.e., the weights. The paper ends with Sect. 8 containing some concluding remarks that point out the attained achievements.

Notation and preliminaries
In this section we explain the notation and some basic notions of polynomial differential forms. Given n + 1 point in general position in ℝ n , the n-simplex with these vertices is their closed convex hull. Any subset of k + 1 vertices of a n-simplex defines a face of dimension k, with 0 ≤ k ≤ n . Faces are simplices themselves. Let k (T) be the set of faces of dimension k (or k-subsimplices) of the n-simplex T. If we introduce an ordering 3 of the vertices of T, { 0 , … , n } , then we can identify univocally any k-face F of T with an increasing With each point ∈ T we may associate a (n + 1)-uple 0 ( ), 1 ( ), … , n ( ) such that We call barycentric coordinates for in T the values i ( ) for i = 0, ..., n.
For the construction of small 1-simplices associated with particular sets of nodes in T, we need to introduce the concepts of simplicial complex and map (see, e.g., [17]). A simplicial complex K in ℝ n is a collection of simplices such that every face of a simplex of K is also in K and if , ′ are two simplices of K then either ∩ � = �� ∈ K or ∩ � = �. The union of simplices of K is a subset of ℝ n , denoted by |K| and called underlying space of K. Now, let K and K ′ be simplicial complexes and let 0 (K) and 0 (K � ) denote the set of vertices of K and K ′ , respectively. Let us suppose to have a map ∶ 0 (K) → 0 (K � ) such that, whenever vertices 0 , ..., of 0 (K) span a simplex of K, the points ( 0 ), ..., ( k ) are vertices of a simplex of K ′ . Then can be extended to a continuous map g ∶ |K| → |K � | such that 3 We can fix an orientation of the n-simplex. and g is called the simplicial map induced by the vertex map . Moreover, if the vertex map is a bijection between 0 (K) and 0 (K � ) and v 0 , … , v span a simplex of the complex K if and only if (v 0 ), … , (v k ) span a simplex of the complex K ′ , we say that the induced simplicial map g is a simplicial isomorphism of K with K ′ .
For the high-order case, multi-index notations are used. For each m ∈ ℕ , m ≥ 0 and s ∈ ℕ we denote by I(m + 1, s) the set of m + s s multi-indices of length m + 1 and weight s, namely We denote by k (T) the space of smooth differential k-forms in T. We associate with each F ∈ k (T) the Whitney form F ∈ k (T) defined in the following way (see, e.g. [24]): If k = 0 then F is a vertex i of T and i = i . If k = n then F = T and T = d 1 ∧ ⋯ ∧ d n is the volume form. We finally denote by the space of trimmed polynomial k-forms. Its elements are the Whitney polynomial k-forms of degree s + 1 . When k = 0 , we get P − s+1 0 (T) = P s+1 0 (T) , the spaces of polynomial 0-forms of degree s + 1 . On the other hand for k = n we have that P − s+1 n (T) ∶= Span{ d 1 ∧ ⋯ ∧ d n ∶ ∈ I(n + 1, s)} = P s n (T) , the space of polynomial n-forms of degree s.
We briefly recall classical notions for k = 0 (see, e.g., [8,9]) in order to compare them with the extensions that will be discussed later. A set M = { j } m j=1 of points in T ⊂ ℝ n , n > 0 , such that a polynomial u ∈ ℙ r (T) is univocally determined by its values u( j ) at these points is said to be unisolvent for ℙ r (T) . If card (M) = dim ℙ r (T) then M is said to be minimal. The Lebesgue constant is a well known indicator to estimate the quality of a set of nodes for the interpolation in ℙ r (T) , with T ⊂ ℝ n , n > 0 , of scalar functions. Given a set M = { j } m j=1 unisolvent and minimal for the Lagrangian interpolation in ℙ r , the Lebesgue constant associated to M is defined as 0 Here, by ‖ ⋅ ‖ ∞ we denote both the maximum norm of a function f ∈ C 0 (T) ( ‖f ‖ ∞ = max ∈T �f ( )� ) and the infinity norm of a vector ∈ ℝ m ( ‖ ‖ ∞ = max 1≤i≤m �v i �).
Moreover, the Lebesgue constant appears when estimating the interpolation error. In deed, let f * r be the best approximation polynomial of degree r of the scalar function f in T, for which ||f − f * r || ∞ ≤ ||f − z r || ∞ for any other polynomial z r of degree r defined in T. The following well-known result holds: In (1), the growth of the Lebesgue constant 0 M determines the convergence in the maximum norm. Moreover, the same inequality suggests that, when the Lebesgue constant does not grow too fast, we can have an approximation of f on T that is almost as good as the best approximation f * r by taking 0 r f , that is easier to compute than f * r . There is a relevant literature for the case k = 0 (see [11,14,19] and the references therein), widely dedicated to the problem of selecting a good and easy to be defined set of nodes M for the high order polynomial interpolation of continuous functions f on nontensorial domains as the simplex T.

Polynomial interpolation of forms and the Lebesgue constant
In order to introduce the definition of the generalized Lebesgue constant, we recall few essential concepts and refer to [2] for more details. The mass | | 0 of a k-simplex ⊂ ℝ n is its k-dimensional Hausdorff's measure. In particular, the mass of a point is 1. A simplicial k-chain c is a formal (finite) sum of k-simplices with real coefficients. The mass |c| 0 of a simplicial chain c = We denote by C k (resp. C k (T) ) the space of simplicial k-chains in ℝ n (resp., supported in T). Spaces of differential k-forms in T are equipped with the norm Note that if ∈ C 0 k (T) then || || 0 = || || C 0 , being the latter the maximum norm for k = 0 (see, e.g., [12]).
We recall and extend some classical definitions to the context of polynomial interpolation of differential forms.

Definition 1
We say that the set X k r = { 1 , ..., N k,r } of k-simplices supported in T is unisolvent for the space P − r k (T) if the weights ∫ j on the k-simplices j ∈ X k r are unisolvent degrees of freedom for ∈ P − r k (T) , that is, if the unique differential

Definition 2 Given a basis
for the space P − r k (T) and a unisolvent set X k r of k-simplices supported in T, the generalized Vandermonde matrix V X k r ,B is the matrix with entries Definition 3 Let X k r be a unisolvent and minimal set for the space

Definition 4 Given a set
The interpolation problem associated with the set of k-simplices X k r has a unique solution if and only if the generalized Vandermonde matrix and we look for k r ∈ P − r k (T) , the interpolation problem reduces to compute the vector ∈ ℝ N k r such that Hence, the interpolation problem is equivalent to solve V X k r ,B = , being the vector of components i = ∫ i , with i ∈ X k r that has a unique solution if and only if the matrix V X k r ,B is invertible.

Definition 5
We say that we interpolate a differential k-form over the set X k r of k-simplices in T when we construct k The definition of the Lebesgue constant has been generalized in [2] to the case of interpolation of continuous differential k-forms ∈ C 0 k (T) by polynomial k-forms Definition 6 (see [2]) Given a set X k r = { 1 , ..., N k,r } of N k,r k-simplices supported in T that is unisolvent and minimal for the space P − r k (T) , the Lebesgue function In Fig. 1 we illustrate the interaction among the principal ingredients at play in the polynomial interpolation. Given any basis {w j } j of the local polynomial space, and any set of unisolvent dofs, the values of these dofs for the elements of the given basis constitute the entries of the so-called Vandermonde matrix, simply denoted by V in the figure. This matrix has to be inverted once to construct the local dual basis { j } j associated with the selected set of dofs and its conditioning cond (V) depends on the local basis {w j } j . Hence it is convenient to look for an initial basis for which the condition number of the Vandermonde matrix is small enough to guarantee an accurate computation of the dual basis Note that the value of the Lebesgue constant is independent from the initial basis {w j } j of the polynomial space, here P − r k (T) . The choice of this basis has influence on the values of the Vandermonde matrix conditioning when the approximation degree r 1 Simplified visualization of the interaction among decisive ingredients or steps for the success of the multivariate high-order polynomial approximation. The conditioning of the Vandermonde matrix V matters when computing the dual basis and the growth of the Lebesgue constant with the approximation degree r has to be slow for a stable interpolation increases. In this work we analyse different sets of weights, characterized by low values of the Lebesgue constant, in order to obtain a stable interpolation when the local discrete space is P − r k (T) with k = 1 . This analysis is done locally, on one mesh element, before performing the approximation over the entire mesh. In the spirit of the geometrical construction proposed by Whitney, the question becomes how to construct different distributions of k-subsimplices, k > 0 , that are unisolvent and minimal for the interpolation in P − r k (T) of differential k-forms and compare them in terms of the generalized Lebesgue constant.

Families of unisolvent and minimal 1-simplices
Starting from a distribution of nodes in T that are unisolvent and minimal for P − r 0 (T) , we wish to generate a set of small edges that are unisolvent and minimal for P − r 1 (T) . With the term uniform distribution, we indicate that the Any other distribution that does not fulfill this requirement will be referred to as nonuniform. In [20], a family of small k-simplices naturally associated with the uniform distribution of nodes in T has been defined. In [7] it has been proved that the set of the small k simplices is unisolvent, for any k. Following [1], a minimal and unisolvent subset X 1 r of small 1-simplices can be identified.
♢. On the edges of a simplex T: In the interval [−1, 1] a classical nonuniform distribution of nodes is the one corresponding with the zeros of the Lobatto polynomials provided we add the interval extremities ±1 . The Lobatto polynomial of degree s is defined as Lb is the first derivative of the Legendre polynomial of degree s + 1 in t ∈ (−1, 1) . Therefore, Lobatto nodes {t i } i=0,r asso- . It is well known that the Lobatto set of nodes is optimal for the scalar interpolation in [−1, 1] , as proved in [10]. The nodal distribution of degree r ≥ 1 on the edge E = [ 0 , 1 ] is the set of nodes On the edge E = [ 0 , 1 ] , uniform and Lobatto nonuniform distributions X 1 r (E) of small edges are obtained by chopping [ 0 , 1 ] at, respectively, the uniform and Lobatto points (see an illustration drawn below for r = 4) It is well known that both the uniform and nonuniform distributions of small edges thus obtained in 1D are unisolvent and minimal for differential forms in Numerical results on the conditioning of the Vandermonde matrix are given in Table 1. Assuming to move along E from 0 to 1 , we label increasingly the small nodes of X 0 r (E) , from 0 (the small node that coincides with 0 ) to r (the small node that coincides with 1 ). By labeling the small edges X 1 r (E) with the label of their first extremity, both sets X 1 r (E) are characterized by the same small edge-to-small node connectivity table, whenever the spatial coordinates of the small nodes in X 0 r (E) are. Therefore, we can construct the nonuniform set X 1 r (E) by relying on the one defined for the uniform case, by just modifying the coordinates of the small edge extremities in order to have them coincident with those of the nodes belonging to the nonuniform Lobatto ones. This strategy will be extended to the faces F and to the interior of T, since all nonuniform distributions of small nodes we consider in T are obtained as suitable modifications of the uniform one.
♣. On the faces of a simplex T: To define X 1 r (F) on a triangle F we wish to proceed with the same (chopping) strategy as the one adopted on the edges E of T. Before, we need to generate the set X 0 r (F) of small nodes in F. As a first attempt, we use the Cartesian product of distributions of small nodes defined on two edges E of F as follows.
1. To construct the set X 1 r (F) of the uniform distribution of 1-simplices in the triangle F = [x 0 , x 1 , x 2 ] , we start by considering the uniform distribution of nodes in F defined as  with u i = i∕r (see in Fig. 2 left, the green and red points obtained for r = 4 in F). On each edge E, we define X 1 r (E) as described in ♢ . To generate the set X 1 r (F) of small edges lying at the interior of F, we connect the points of X 0 r (F) by segments parallel to the edges E of F that have one extremity in 0 . Chop these segments at the intersection points in F (see in Fig. 2 center and right, respectively, the red nodes and the small edges obtained for r = 4 ). The small nodes at the interior of F together with those on its boundary constitute a unisolvent and minimal set X 0 r (F) of nodes for the interpolation of 0-forms, which is indeed the principal lattice of order r in F = [x 0 , x 1 , x 2 ] , defined as in terms of the barycentric coordinates of F. 2. To construct the set X 1 r (F) of the nonuniform distribution of 1-simplices associated with the Lobatto nodes on the edges E of F, we proceed similarly to the uniform case. We start by considering the Lobatto nonuniform distribution of nodes in F defined as x 0 x 2 Fig. 2 Construction, in a triangle F, of a uniform and parallel distribution of small edges with ending points in the nodes of the principal lattice (here drawn for r = 4 ). On the left, the points of the principal lattice X 0 r (F) ; on the right, the set of edges X 1 r (F) x 1 x 0 x 2 Fig. 3 Construction, in a triangle F, of a nonuniform distribution of small edges that are ∥ to E ∈ 1 (T) , with ending points in the Lobatto nodes (here drawn for r = 4 ). On the left, the set of points X 0 r (F) ; on the right, the set of edges X 1 r (F) with u i = (1 + t i )∕2 , being t i ∈ [−1, 1] the roots of (1 − t 2 ) L � r (t) (see in Fig. 3 left, the green points obtained for r = 4 on the boundary of F). On each edge E, we define X 1 r (E) as described in ♢ . To generate the small edges X 1 r (F) lying at the interior of F, as in the uniform case, we connect the small nodes of X 0 r (F) by segments parallel to the edges E of F incident in 0 (see in Fig. 3 center and right, respectively, the red nodes and the small edges obtained for r = 4 ). Note that the interior and the boundary points of X 0 r (F) constitute a unisolvent and minimal set of nodes for the interpolation of 0-forms, which is the Lobatto distribution of degree r in F. In term of the barycentric coordinates of F the set of such points reads The two sets X 1 r (F) of small edges lying on a face F of T, associated with the uniform (in ♣.1 ) and nonuniform Lobatto (in ♣.2 ) distributions X 0 r (F) , are far from being "good" choices for the interpolation in P − r 1 (F) . This is also confirmed by the numerical results we present later. For the uniform set, this is an expected consequence of the well known fact that polynomial fitting on equally spaced nodes (and consequently on edges) can lead to poor interpolation properties for high degrees r. For the Lobatto points the reason can be related to the lack of rotational symmetry of the internal points (see Fig. 3). It is worth noting that Lobatto points can be straightforwardly extended to higher dimension, while keeping their property of being the zeros or the extrema of orthogonal polynomials, only on tensorial domains (Cartesian products of intervals).
In nontensorial domains, as triangles and tetrahedra here considered, there are three important requirements to fulfill with nodes: (i) interpolation nodes should be nonuniformly distributed and endowed of a rotational symmetry. In this way, wild oscillations are minimized and spectral convergence of the interpolation error is ensured for smooth functions; (ii) the generating algorithm should be simple, ideally with an explicit formula; (iii) the Lebesgue constant should not grow too fast with the degree r. So, to define reasonable sets X 1 r in F or T, we need to start from distributions of nodes X 0 r that are "good" for high order multivariate polynomial interpolation. The existing literature deals with the complex problem of generating interpolation points in a precise and efficient way by respecting the three requirements above, starting from the Lobatto distribution along the edges E of T (see [5,13,19,21] and the references therein). Among all the possibilities, we consider the set of points introduced in [22]. The definition of such a set depends on a parameter ∈ ℝ . In the following, we refer to these points as the symmetrised Lobatto (sym. Lb) nodes when generated with = 0 , and as the warp & blend (WB) nodes when = opt (r) (see Table 7 in [22]). They have been chosen because of their attractive features with respect to convergence and also because they are given through an explicit formula, which is of great practical interest, especially in three dimensions where the optimization procedures involved in the definitions of other nonuniform distributions of nodes become quite complicated. The generation of the symmetrised Lobatto and warp & blend distributions X 0 r in a triangle or tetrahedron T is performed by running the Matlab software available in [22] for the triangle and in [14] for the tetrahedron. These nonuniform distributions of nodes in 2D and 3D are obtained by starting from the uniform one through a suitable vertex mapping, that induces a simplicial isomorphism between simplicial complexes, as we are going to explain.
3. To define X 1 r (F) on a triangle F = [x 0 , x 1 , x 2 ] by starting from the set X 0 r (F) of symmetrised Lobatto or warp & blend nodes in F, we proceed as follows. Define in F the uniform distribution X 0 Un (F) = X 0 r (F) . Construct the set of small edges X 1 Un (F) = X 1 r (F) corresponding with X 0 Un (F) as described in ♣.1 (see in Fig. 4 left, the red nodes and the small edges obtained for r = 4 ). We thus have in F a simplicial complex K = X 0 Un (F) ∪ X 1 Un (F) . We apply the vertex map defined in [22] for the 2D case, that makes corresponding X 0 Un (F) with the new (symmetrised Lobatto or warp & blend) point configuration, say X 0 new (F) , defined as (X 0 Un (F)) . Hence, the points on the edges E and at the interior of F are in the position corresponding with either the symmetrised Lobatto or the warp & blend ones (see in Fig. 4 center and right, respectively, the red nodes and the small edges obtained for r = 4 ). We thus obtain the new simplicial complex is the set of small segments on the edges and at the interior of F obtained from X 1 Un (F) by following the node movement towards the new position. We then set X 1 r (F) = X 1 new . Note that the new small edges are thus stretched and, for those at the interior of F, their direction is no more parallel to the edges of F.

♠. On a tetrahedron T:
To define X 1 r (T) on a tetrahedron T we wish to proceed with the same (chopping) strategy as the one adopted on the edges E and faces F of T. Before, we need to generate the set X 0 r (T) of small nodes in T. To this purpose, we use either the uniform or the nonuniform symmetrised Lobatto and warp & blend distributions of small nodes in T and we proceed as follows.
1. To construct the set X 1 r (T) of the uniform distribution of 1-simplices in the tetrahedron T = [x 0 , x 1 , x 2 , x 3 ] , we start by considering the uniform distribution of nodes in T defined as with u i = i∕r . On each edge E, we define X 1 r (E) as described in ♢ and on each face F, we define X 1 r (F) as explained before in ♣.1 (see Fig. 2). Then, we repeat the uniform construction ♣.1 for X 1 r (L) over all (r − 1) triangular internal levels L which are parallel to the three faces F of T insisting in 0 . These levels are located at the heights defined by the points on the edges of extremities 0 and T ⧵ F , respectively. On each of these internal levels, we keep only the generated small edges that do not belong to one of the faces F of T. Note that, when moving from 0 towards T ⧵ F , while remaining parallel to a face F, the degree for the node distribution on each new level has decreased of 1 with respect to the previous level. We thus obtain X 1 r (T) collecting all the small edges defined on the edges, faces and internal levels of T. 2. To define X 1 r (T) for the symmetrised Lobatto or warp & blend distribution X 0 r (T) in T we consider the simplicial complex K = X 0 Un (T) = X 0 r (T) and X 1 Un (T) = X 1 r (T) as defined for the uniform distribution in ♠.1 . We apply the vertex map Φ defined in [22] for the 3D case, that makes corresponding X 0 Un (T) with the new (symmetrised Lobatto or warp & blend) point configuration, say X 0 new (T) in T, defined as Φ(X 0 Un (T)) . Hence, the points on the edges, faces and at the interior of T are in the new position corresponding with either the symmetrised Lobatto or the warp & blend ones. We thus obtain the new simplicial complex is the set of small segments obtained from X 1 Un (T) by following the node movement towards the new position. We then set X 1 Even if these configurations are suitable perturbations of the uniform one, the proof of unisolvence and minimality for their associated set of weights becomes difficult. However, the Vandermonde matrix associated with any of the considered distributions is not singular. It can thus be inverted, and this yields the construction of the dual basis { X 1 r j } j associated with X 1 r , basis involved in Definition 6. The conditioning of V X 1 r ,B when B is the Bernstein basis of P − r 1 (T) is presented in Table 2 (resp., Table 3) for the sets X 1 r in a triangle (resp., in a tetrahedron) T.

Estimation of the Lebesgue constant
In order to estimate k X k r , the supremum on the set of all k-chains in T is replaced by a maximum on the set k ( ) of k-simplices c of an additional mesh defined in T, finer enough to stabilize numerically the maximum. We thus have   4. Compute the inverse W of V by solving the linear system W = V ⧵ I with I the identity matrix of size N k,r . 5. Define a fine mesh in T and the set Y k = {c } =1,M k of the k-simplices of . Algorithm 1 has been used for a numerical estimation of the Lebesgue constant introduced in Definition 6, given r ≥ 1 and k > 0.
In this section we present some numerical results on the Lebesgue constant associated with these distributions of k-simplices in the standard simplex T, for k = 1 , in one, two and three dimensions. To construct the Vandermonde matrix, and thus the dual basis, we consider the basis {w j } j of the space P − r 1 (T) with elements w j that are products between Bernstein polynomials of degree (r − 1) and Whitney 1-forms of polynomial degree 1 (see for example [7]). With this choice of local basis, the conditioning of the Vandermonde matrix varies within an acceptable range of values when the approximation degree r increases (see Tables 2 and 3). Since the Lebesgue constant given in Definition 6 coincides, for k = 0 , with the classical one, we expect the results on this constant for k = 1 to be similar, in a sense to be precised, to those for k = 0 on the same (uniform or nonuniform) type of configurations of small supports for the degrees of freedom (the weights) of polynomial differential k-forms belonging to the discrete space.

In 1D
For the Lebesgue constant given in Definition 6, the computed values in the interval [0, 1] for k = 0 and k = 1 are given in Table 4. Numerical results on the Lebesgue constant confirm the interest of working with a nonuniform distribution of small edges supporting the degrees of freedom for the space P − r 1 (T).

In 2D
For the Lebesgue constant given in Definition 6, the computed values in the standard 2-simplex T in two dimensions for k = 1 are given in Table 6 and are compared with those of Table 5 for k = 0 taken from [5,22]. The results for k = 1 are obtained by considering the maximum on an independent test mesh in T, that is much finer Table 4 For k = 0 and k = 1 in 1D: Lebesgue constants associated with the uniform and Lobatto distributions of nodes in a segment T for different numbers of subintervals r ≥ 2 . For k = 0 (resp. k = 1 ), r coincides with the degree (resp. the degree plus one) of the polynomial differential form  than the one corresponding with degree 12 and not obtained as a refinement of those associated with the analysed degrees. In 2D, the mesh has been created by the software Triangle and it contains 513 edges with length between 0.011 and 0.120. It has to be said that by modifying the test mesh, the computed values can have slight changes in decimals but their magnitude order does not change. These values are visualized in Fig. 5 (for the same k) and in Fig. 6 (for the same type of distribution) in semi-log scale with respect to the polynomial degree r of the k-forms to be interpolated, with k = 0, 1 , apart from those corresponding to the Lobatto distribution. By looking at Fig. 5, we remark that the difference of behavior in the Lebesgue constant for the uniform and nonuniform distribution, which is well-known for k = 0 , holds for k = 1 too. For k = 0 , the warp & blend (WB) distribution is known to perform, in terms of the Lebesgue constant growth, as one of the best, among those that are nonuniform with rotational symmetry, thus better than the symmetrised Lobatto (Lb sym). In Table 6, we see that the behavior of the Lebesgue constant for the nonuniform distributions of small edges is analogous to that for the   Fig. 6 confirms the fact that the results on the Lebesgue constant for k = 1 behave similarly to those for k = 0 on the same (uniform or nonuniform) type of configuration of small supports for the degrees of freedom of the discrete space. An exponential behavior fits the curves in Fig. 6 for both k = 0, 1 , with a smaller coefficient in front of r as soon as the distribution of the small simplices is nonuniform over T. Note that we have 1 for all r and for sets of weights X 0 r , X 1 r such that the ending points of the small edges supporting the weights of X 1 r are the small nodes supporting the weights of X 0 r . Note that the considered distributions of small edges do not fulfill the rotational symmetry requirement over T. An improvement to get more symmetric layouts on a face of T or at the interior of T is possible but the strategy to perform it is not clear at the moment.

In 3D
Computed values for the Lebesgue constant in the standard 3-simplex T in three dimensions for k = 1 are given in Table 8 and are compared with those of Table 7 for k = 0 taken from [5,22]. Again, the results for k = 1 are obtained by estimating the  supremum on an independent test mesh in T, much finer than the one corresponding with degree 9 and not obtained as a refinement of those associated with the analysed degrees. In 3D, the mesh has been created as uniform, with nodes in the principal lattice of degree 23 in T. It contains 13 800 edges with length varying between 0.0435 and 0.0615. The Lebesgue constant values, apart from those corresponding  Moreover if X k r,new (T) is a unisolvent and minimal set for the space P − r k (T) then so is X k r,new (T) for P − r k (T) since F T is invertible.
Lemma 1 Let X k r (T) = {̂1, … ,̂N k,r } be a unisolvent and minimal set for the space P − r k (T) and put X k Proof By definition of dual basis, [3]). Moreover where the last equality follows from the fact that  F T X k r,new (T) = X k r,new (T) .
If z is a k-differential form on T and T = F T (T) then F * T z is the unique k-differential form on T such that ∫̂c F * T z = ∫ F T (ĉ) z for all ĉ ∈ C k (T). Table 9 reports the quantity 1 and T is the equilateral tetrahedra with length of edges equal 2 centered in the origin. The vertices of T are (−1, −1∕ , and (0, 0, 3∕ √ 6) . We consider the uniform, the symmetrised Lobatto and the warp & blend distributions of nodes, and different values of r. The quotient 1 We consider also the case in which T is the standard 3-simplex, and T = T is the tetrahedron of vertices (0, 0, 0), . In this family of tetrahedra the height is constant area the area of the base decreases to zero when tends to 1/3. Clearly ‖B ‖ 2 ‖B −1 ‖ 2 tends to infinity when tends to 1/3. Table 10 reports the quotient 1 for different values of , r = 7 , and the distributions of nodes uniform, symmetrised Lobatto and warp & blend. The quotient increases when the base shrinks, nevertheless it always remains below the theoretical bound. (4) does not depend on the distribution of nodes. A sharper bound can be obtained introducing the following quantity depending on   (1) the command that gives random real positive values lower than 1. In Fig. 9 we report the quantities 1 || 1 r − 1 r̃ || 0 and compare them with their relative Lebesgue constants. For the sake of brevity, we have reported only the cases = 10 −2 , = 10 −5 and = 10 −8 . According to (5) results are independent from .

Remark 1 Estimate
Distribution of edges constructed from nodes that are more suitable for high order Lagrange interpolation than the uniform ones, such as the symmetrised Lobatto and the warp & blend, improve the stability for k = 1 . The asymmetry of the distribution of nodes with respect to the vertices of T in the Lobatto grid results in a very fast increase of the amplification of the perturbation. Results confirm the behavior predicted by the Lebesgue constant. The amplification of the perturbation on the data with respect to the polynomial degree increases as the Lebesgue constant does. Indeed, a visual comparison in semilogarithmic scale as in Fig. 9 shows that 1 || 1 r − 1 r̃| | 0 grow simultaneously to the Lebesgue constant; we hence deduce that estimate (5) is sharp. In particular, Fig. 9 (left) depicts data relative to the uniform and warp & blend distributions. Data relative to symmetrised Lobatto are not shown as they offer a very similar behavior to that of warp & blend. The same computation for the tridimensional case, Fig. 9, right, shows a comparable behavior. The value of the Lebesgue constant estimated by (6) is thus an upper bound of 1 || 1 r − 1 r̃| | 0 , for any , the numerical one.

Conclusions
We have proposed a flexible rule to select a minimal and unisolvent set of small edges to interpolate a differential 1-form using high order Whitney finite elements. The interpolating polynomial differential form has the same weights (integrals on the small edges) as . Weights are alternative degrees of freedom to moments for high order trimmed polynomial spaces. We have tried different choices of supports for the weights and we have studied the growth of the generalized Lebesgue constant when increasing the polynomial degree r and the degree k of the polynomial differential forms. We have studied the dependence of the generalized Lebesgue constant on the shape of the simplex. Finding a minimal and unisolvent distribution of small edges that is optimized on the basis of a given property has not been considered in the present work. Numerical results have evidenced the importance of the Lebesgue constant in qualifying a good distribution of small simplices supporting the weights. They are in agreement with the fact that to have a lower value of this constant, a nonuniform distribution of the geometrical supports for dofs is determinant both for k = 0, 1 . They have also revealed that the behavior of the Lebesgue constant for k = 1 is similar to that for k = 0 (parallel curves), on each configuration we have considered. Moreover, for a given degree r, the value of this constant grows with k, once we fix the ambient dimension n, and with n, once we fix the degree k of the differential form. The stability analysis confirms that the amplification of the perturbations on the data behaves, with respect to the polynomial degree r, as the Lebesgue constant does. Interpolation results give further confidence on the quality of the warp & blend distribution. The very natural extension of this approach to differential k-forms for 0 < k < n is also ongoing and first results for k = 2 in 3D are in agreement with those provided in this work for k = 0, 1.