## Abstract

We present an extended range of stable flux reconstruction (FR) methods on triangles through the development and application of the summation-by-parts framework in two-dimensions. This extended range of stable schemes is then shown to contain the single parameter schemes of Castonguay et al. (J Sci Comput 51:224–256, 2011) on triangles, and our definition enables wider stability bounds to be developed for those single parameter families. Stable upwinded spectral difference (SD) schemes on triangular elements have previously been found using Fourier analysis. We used our extended range of FR schemes to investigate the linear stability of SD methods on triangles, and it was found that a only first order SD scheme could be recovered within this set of FR methods.

### Similar content being viewed by others

## 1 Introduction

The flux reconstruction (FR) [2] method is a versatile numerical approach to approximating the solution of advection–diffusion equations and can be generalised to arbitrary order accuracy. A compelling advantage of the FR method is the dominance of locally structured computation in the algorithm, making it highly efficient on modern GPU hardware [3]. Furthermore, the FR method can be thought of as a generalisation of the discontinuous Galerkin (DG) [4, 5] method over the set of different lifting functions. Within the FR literature, these lifting functions are realised through what are called a correction functions. In the seminal work of Huynh [2], it was shown that changes to the correction function could result in significantly different numerical characteristics.

Families of correction functions can be formed by considering different norms in order to prove linear stability. The proofs of linear stability generally look to show that for a system such as:

The objective of stability proofs for FR was to find some correction function where the following is true:

for some norm *A*, such as in the work of Vincent et al. [6]. It was later shown by Allaneau and Jameson [7] and Zwanenburg and Nadarajah [8] that there is an equivalence between FR and linearly filtered DG. The work of Vincent et al. [9] defined a wider—multi-parameter—set of stable FR schemes which can be interpreted as a wider set of filters, with the filter implicitly defined by *A*. Concurrently, Ranocha et al. [10] showed how FR could be cast into a summation-by-parts (SBP) formulation to achieve the same results.

In the work of Castonguay et al. [1], and later that of Williams et al. [11], a stable set of FR schemes on triangles was defined that is analogous to those defined in 1D by Vincent et al. [6]. For simulations of real flows, triangular elements are advantageous due to the ease of mesh generation for complex geometries, such as via Delaunay triangulation. Concurrently to these works on FR, Balan et al. [12] defined a spectral difference (SD) method on triangles. The FR and SD methods are closely related [13]; however, previous works like that of Veilleux et al. [14] have used Fourier analysis with upwinding to find stable SD schemes. In general, SD schemes on triangles are weakly unstable, and we would like to answer if stable SD methods on triangles can be found as a subset of linearly stable FR methods.

The objective of this work is twofold, firstly we investigate the FR method on triangles further through the use of the SBP framework. We seek to extend the current definition of linearly stable FR methods on triangles from that of Castonguay et al. [1] to a definition analogous to that of Vincent et al. [9]. Furthermore, we will study the conditions needed for stability, symmetry, and conservation. Secondly, using this extended definition of stable FR on triangles we investigate the connection between FR and SD, and whether linearly stable SD methods can be found within this set of FR methods. With this in mind, this work is structured as follows. In Sect. 2 we introduce the FR method, previous correction functions, and the SBP framework. The main results of this work are presented in Sect. 3, where linear stability of the FR method on triangles is explored, and conditions are set out for conservation and symmetry. In Sect. 4, we define the new set of stable FR methods for several orders and prescribe there stability conditions. Then in Sect. 5 we use this extended range of stable FR of schemes to investigate SD on triangles. In Sect. 6 we present some brief numerical results from using the newly found FR schemes and finally conclusions are drawn in Sect. 7.

## 2 Preliminaries

### 2.1 Flux Reconstruction

The flux reconstruction (FR) method of Huynh [2] can be applied to advection and advection–diffusion systems as a method of spatial discretisation. In this work we solely focus on advection systems, and we now give a brief introduction to the FR method in one dimension. For a more detailed description of the method, readers can see references Huynh [2], Witherden and Vincent [15] and references therein.

Beginning with (3.1), the first stage of FR is to subdivide the domain *K* into *N* compatible sub-domains, \(\{K\}_{i\le N}\), such that:

A reference sub-domain \(\hat{K}=[-1,1]\) is defined with the transformation \(T_i:K_i\mapsto \hat{K}\), such that interpolation and differentiation operators can be more efficiently applied. Here we will only consider affine elements, i.e. where \(T_i\) is a linear functional. For a given polynomial order, *k*, \(k+1\) solution points are placed in the sub-domains at the physical locations \(\{x_{ij}\}_{0\le j\le k}\), and in the reference sub-domain at \(\{\xi _{j}\}_{0\le j\le k}\).

Polynomials of the solution and flux functions from element \(K_i\) can be fitted in \(\hat{K}\) using a Lagrange finite-element as

To the flux we have added superscript \(\delta \) to symbolise its correspondence to a discontinuous solution. An approximation to the continuous flux gradient is then formed via the correction procedure as

The last and penultimate terms on the right-hand side are used to correct the discontinuous flux to continuous; required for the method to be conservative. Subscripts *L* and *R* are used to denote a quantity at the left or right interface and in the case of \(\hat{f}^\delta \) these values are interpolated. For \(\hat{f}^\textrm{num}\) these are interface values that are common to the all the elements that share that interface point. Later for linear equations we will define how this is set, but for alternative equation sets approximate Riemann solver offer a suitable means of setting \(\hat{f}^\textrm{num}\).

In (2.3) we introduced the functions \(h_L\) and \(h_R\), these are the correction functions with the boundary conditions \(h_L(-1)=h_R(1)=1\) and \(h_R(-1)=h_L(1)=0\). Due to \(u_i\in \mathbb {P}_k\), we have that \(h_L,h_R\in \mathbb {P}_{k+1}\). Although it is not necessary, it is typical to set \(h_L\) and \(h_R\) as degree \(k+1\) polynomials. The primary aim of this paper is then how to set these correction functions such that methods are linearly stable.

Lastly, the corrected flux gradient can be coupled to an explicit time integration method, such as SSP-RK3, or coupled to some more complex implicit time-integration system, such as diagonally implicit Runge–Kutta [16].

### 2.2 Correction Functions

In the earliest paper on the subject of FR, Huynh [2] noted the different numerical properties realised by changing the correction function. In the later works of Vincent et al. [6, 17], these correction functions were extended to form continuous classes of functions in one-dimension. With all but one of the correction functions put forward by Huynh [2] being found to be in that class. In the more recent work by Trojak and Witherden [18], a weighted norm was used in the continuous analysis framework of Vincent et al. [6] to produce yet another one parameter family of correction functions with Jacobi orthogonal polynomials as the basis. This idea can be taken to the natural conclusion for any weight function that is positive almost every by using the three-term recurrence relation to generate sets of monic orthogonal polynomials [19].

An alternative approach that was taken by Trojak [20] was to extend the norm used to define stability. Previously, a limited Sobolev norm was used that was sufficient to define the topology of the approximation space, but does not fully capture it. The high order terms at the interfaces that occur in the stability analysis can not be reconciled with the analysis of Vincent et al. [17], it nonetheless showed that it was possible to construct vast sets of correction functions.

In the work of Castonguay et al. [1], an analogous family of correction functions to Vincent et al. [6] was defined on equilateral triangles. To define this, first consider the (*m*, *k*)-differentiation operator in two dimensions as

The Dubiner basis [21] can then be defined as

### Definition 2.1

(Dubiner Basis) The set

is orthogonal over a reference equilateral triangle, where

The orders *w* and *v*, are then integer solutions to:

where \(\psi ^{(\alpha ,\beta )}_i\) is a normalised Jacobi polynomial and \(\psi _i^{(0,0)}=\psi _i\) is a normalised Legendre polynomial. With this definition we can define the set of basis polynomial as

We can now define the correction function family of Castonguay et al. [1] in the following lemma

### Lemma 2.2

(Castonguay et al. correction functions) For a flux point j at the \(\overline{\textbf{x}}_j\) and with surface quadrature wight \(w_j\), then defining the reconstructed divergence of the correction corresponding to point *j* as

then if the modal coefficients are found from

a sufficient condition for linear stability of the resulting FR method is that \(c>0\).

### Proof

See Castonguay et al. [1]. \(\square \)

### Remark 2.3

Both the Dubiner basis and the Castonguay correction functions are defined on a triangle with a total order basis [22]. This is the most commonly used basis for simplex elements due to the trace space being a polynomial space, and so we will restrict our investigation to these elements.

The work discussed until now used a continuous approach to find correction functions. A different insight may be gained if a discrete approach is used. This was the approach used by Vincent et al. [9] to produce an extended range of stable corrections, which was later encompassed in the work of Trojak [20]. This discrete approach was further formalised within the summation-by-parts framework in the work of Ranocha et al. [10]. In that work it was also shown how a skew-symmetric split form with a lumped mass matrix could be used to prove stability for Burgers’ equation, but not in the general case.

### 2.3 Summation-By-Parts

Many advances have been made in the theory of DG and FR methods by considering the discrete problem. A foundation of these analytic techniques is the definition of summation-by-parts (SBP) operators.

First let us define the basic discrete operators that will be used throughout this work. If \(u_i\) is an approximation in element \(K_i\) to the function \(u\in C^1(K)\), where for our domain we have \(K\subset \mathbb {R}^d\). Then for some set of \(N_s\) solution points \(\textbf{x}_i=\{\textbf{x}_{i,j}\}_{j\le N_s}\) we have the vector \(\textbf{u}_i=u_i(\textbf{x}_i)\), which is the evaluation of \(u_i\) at the solution points. If \(l_j(\textbf{x})\) is the Lagrange polynomial corresponding to \(l_j(\textbf{x}_{i,k})=\delta _{jk}\), then we can define a mass matrix as

If we call the cardinal axes \(x_1,\dots ,x_d\), then we can define the differentiation operators

In the following we will drop the subscript *i* for clarity except where it is explicitly needed.

Moving on to define SBP in higher-dimensions, we start with the analogy of integration-by-parts in higher dimensions

### Definition 2.4

(Divergence integration-by-parts) For a scalar field, \(v\in C^1(K)\) and a vector field, \(\textbf{W}\in (C^1(K))^d\), in the closed domain \(K\subset \mathbb {R}^d\) with boundary \(\partial K\), then

With this we may then define the generalised SBP relation as

### Definition 2.5

(Generalised Summation-by-parts) For solutions \(u\in C^1(K)\) and \(U\in (C^1(K))^d\), let \(u_i\) and \(U_i\) be approximations in element \(K_i\) such that for some nodal point set \(\textbf{x}_i\{\textbf{x}_{i,j}\}_{j\le N_s}\) we have \(\textbf{u}_i = u_i(\textbf{x}_i)\) and \(\textbf{U}_i = U_i(\textbf{x}_i)\), then a set of operators is said to satisfy the generalised SBP property if:

where the divergence and gradient operators are defined as

Then defining the interpolation operator \(\textbf{L}_{\partial K}:K\mapsto \partial K\), and surface mass matrix, \(\textbf{W}_{\partial K}\), such that

where \(\textbf{n}\) is a vector of outwards facing normals at the interface. Finally, the Kronecker product of a matrix with the identity matrix is denoted by

Examples of the matrices defined here can be found in Sect. B.

### Remark 2.6

From this definition of SBP we see that the restriction on the mass matrix is that it should accurately integrate all functions in at least \(\mathbb {Q}_{2k-1}\). From the definition of the mass matrix in (2.11) this is true, however, in many applications this may not be true if using a quadrature. This case is explicitly handled in Sect. A.

SBP is simply a discrete restatement of integration-by-parts. The advantage is it permits the development of discrete analogues of continuous properties of the physical system. The earliest discussion of SBP in the context of finite element methods, to the authors’ knowledge, is that of Fisher and Carpenter [23]. This was an adaptation of ideas previously used throughout the finite difference community. There are many works studying SBP in a finite difference context, with some of the earliest works including Carpenter and Otto [24] and Olsson [25]. An important work in concreting the utility of these approaches is that of Carpenter et al. [26]. There it was shown that for finite differences applied to hyperbolic systems, a scheme with energy bounded via SBP leads to the solution being bounded in the continuous problem. This is important as it shows consistency of the discrete stability analysis and the continuous problem.

In general the exploration of SBP operators has largely focused on one-dimension, but some recent works have move beyond this. For example, on tensor-product elements [27]. In the work of Hicken et al. [28] they were able to extend the theory to simplex elements using the generalisation of SBP by Fernández et al. [29]. The form given in [29] is analogous to that shown in Definition 2.5.

The operators set out in Definition 2.5 can then be used to construct the FR scheme. First consider a linear advection equation such as

where \(\textbf{f}=\textbf{a}u\). The FR discretisation of the spatial derivatives can be written within the SBP framework as:

where \(\textbf{C}\) is the correction function matrix.

In the previous work of Castonguay et al. [1] and Vincent et al. [9], the modal form was used in the presentation of the stable correction functions as the forms are far sparser. Transformation from a nodal to modal representation is defined via

where \(\tilde{\textbf{u}}\) is a vector of modal coefficients, and \(\textbf{V}\) is the Vandermonde matrix. Throughout the rest of this work we will use a tilde to denote a matrix of vector in the *modal* representation.

## 3 Linear Stability Analysis

To study linear stability, we prescribe the system being solved as a generalised linear advection equation with the form:

First we consider the known correction function where FR corresponds to DG, here stability is found in the \(L_2\) norm induced by \(\textbf{M}\). We do this to demonstrate the use of the SBP framework in higher dimensions and to more clearly set out the interface treatment.

### Lemma 3.1

(Linear Stability) Setting the nodal solution as \(\textbf{u}_i=u(\textbf{x}_i)\) and linear nodal flux as \(\textbf{F} = [a_{x_1},a_{x_2},\dots ]^T\otimes \textbf{u}\), then for the FR scheme applied to (3.1), the following conditions

and

are sufficient for energy stability in the norm induced by the mass matrix, \(\textbf{M}\), i.e.

### Proof

The FR method applied to (3.1) can be written as

Then multiplying this by \(\textbf{u}^T\textbf{M}\) we get

we can then apply (2.14) to obtain a second equation

(3.6) and (3.7) can then be combined to give

here we have used the symmetry of \(\textbf{M}\) which leads to \(\textbf{u}^T\textbf{G}^T\hat{\textbf{M}}\textbf{F} - \textbf{u}^T\textbf{MDF}=0\). Then applying (3.2) we recover

Now considering a mesh of multiple elements and focusing on a single point on the boundary of an element, say point *j*. Using the condition that \(\textbf{W}_\partial \) is diagonal, then the global contribution to the right-hand-side of (3.9) from point *j* is:

Here − and \(+\) are the contributions from either side of the interface, and from (3.3) \(w_j\) is the positive surface quadrature weight at *j*. Then setting the numerical flux from (3.4) we obtain

where we have used \(\textbf{n}_j^+=-\textbf{n}_j^-\) by definition for a conformal mesh. Applying (3.15a) we recover

where we further assume that \(w_j^-=w_j^+\) i.e. the flux points used here have some degree of rotational symmetry. And hence summing over the domain we recover the required result of

\(\square \)

As described in Sect. 2, Vincent et al. [9] and later Ranocha et al. [10] were able to derive a multi-parameter extended-range set of FR methods in one dimension that were linearly stable. These methods were found to be stable in a modified norm such that:

We now generalise this set of methods to higher dimensions in the following lemma

### Lemma 3.2

(Extended-range linear stability) For the conditions set out in Lemma 3.1, with the additional constraints that

and the modified condition that

then FR applied to (3.1) is stable in the norm induced by \((\textbf{M}+\textbf{Q})\), i.e.

### Proof

Following the same steps as in the proof of Lemma 3.1 and using the modified condition in (3.16) we obtain

Then applying (3.15a) and (3.15b), the first term of the right-hand-side is found to be zero, and so proceeding with the proof of Lemma 3.1, we achieve the required results of

The final condition (3.15c) is used to ensure that the norm induced by \(\textbf{M}+\textbf{Q}\) is a valid norm.

\(\square \)

Examples of the matrices defined here can be found in Sect. B.

### Remark 3.3

A stricter condition on \(\textbf{Q}\) is \(\textbf{QD} =- \textbf{G}^T\hat{\textbf{Q}}\); however, when looking for a \(\textbf{Q}\) that satisfies this the solution \(\textbf{Q}=\textbf{0}\) is typically recovered. Alternatively, if the less strict condition (3.15b) is used, a wider range of valid \(\textbf{Q}\) matrices can be found that still guarantee linear stability.

### Remark 3.4

By finding a norm \(\Vert \textbf{u}\Vert _{M+Q}\) where the solution norm monotonically decays in time, we can use the equivalence of norms to infer stability. Therefore, as \(c\Vert \textbf{u}\Vert _M\le \Vert \textbf{u}|_{M+Q}\le C\Vert \textbf{u}\Vert _M\), the norm \(\Vert \textbf{u}\Vert _M\) may not decay monotonically in time, but its rate of decay must remain bounded.

It is often convenient to consider methods in the modal form rather than the nodal form, but to be confident that a scheme found to be stable in modal form is stable in nodal form consider the following:

### Corollary 3.5

(Nodal-modal equivalence) The stability of a scheme that satisfies conditions (3.3), (3.4), (3.15), and (3.16) is independent of modal or nodal representation, provided \(\textbf{V}\) is invertible.

### Proof

To prove this it is sufficient to show that the conditions (3.15), if satisfied in one frame, are satisfied in the other. First consider the transform of \(\textbf{Q}\) as

clearly if \(\textbf{Q}=\textbf{Q}^T\) then \(\tilde{\textbf{Q}}=\tilde{\textbf{Q}}^T\). Next considering the skew symmetry property we have

and

Therefore, if \(\textbf{QD} = -\textbf{D}^T\textbf{Q}\), then \(\tilde{\textbf{Q}}\tilde{\textbf{D}}=-\tilde{\textbf{D}}^T\tilde{\textbf{Q}}\). Lastly for (3.15c) we have to show that if \(\textbf{M}+\textbf{Q}\) is positive definite, then so is \(\tilde{\textbf{M}}+\tilde{\textbf{Q}}\). Considering this property we have that:

which holds as \(\textbf{V}\) is full rank. This completes the proof. \(\square \)

### 3.1 Conservation

### Lemma 3.6

(Linear conservation) Consider the *d*-dimensional FR method with linear flux function such that, for Banach space *V*, \(\textbf{u}\in V\) and \(\textbf{F} = F(\textbf{u})\in (V^\prime ,V)^d\), then sufficient conditions for conservation are that the gradient operator is are least first order accurate, i.e.

and that the lifting operator is such that

### Proof

Let \(\textbf{u}_i=u(\textbf{x}_i)\) and \(\textbf{F} = F(\textbf{u})\), then the FR method can be written as

Then multiplying by \(\textbf{1}^T\textbf{M}\) we obtain

Then applying (2.14) we obtain

If (3.24) holds, then we obtain

and proceeding to apply (3.25) we get

The term on the right-hand side is discrete statement of divergence theorem, which in 1D would give \(f_R - f_L\). Therefore, the scheme is conservative. \(\square \)

### Remark 3.7

A similar lemma can be defined for non-linear flux functions, if an intermediate set of quadrature points is used, see Chan [30].

Here we set \(\textbf{Q}=0\), but Vincent et al. [9] showed how changing \(\textbf{Q}\) could lead some methods to be non-conservative in an integral with unit measure. Conservation of the extended range of stable schemes is then considered in the following lemma

### Lemma 3.8

(Conservation of extended schemes) For an FR scheme that satisfies (3.3), (3.4), (3.15), and (3.16), with a linear flux function, then if the following condition is also satisfied

then the scheme is conservative in that

This can be straightforwardly seen from Lemma 3.6 and (3.16).

### Remark 3.9

What can be seen from Lemma 3.6 and Lemma 3.2 is that any FR method satisfying (3.3), (3.4), (3.15), and (3.16) for a linear flux, is automatically conservative in terms of the norm induced by \(\textbf{M}+\textbf{Q}\). However, this is not physical and could lead to schemes that are not consistent.

### 3.2 Symmetry Conditions

It is taken as axiomatic that the numerical method should be independent of node ordering, or element orientation. As the correction function can change the numerical characteristics of the FR method; therefore, the correction function is required to have some degree of symmetry.

Defining the cardinal axes for different face reference frames, as in Fig. 1a, the transformation of reference coordinates can be made via:

A transformation matrix, \(\tilde{\textbf{T}}_{mn}\), can then be defined which transforms the basis from the face reference space with \(\theta _m\) to \(\theta _n\). This allows rotational symmetry conditions to be imposed on \(\tilde{\textbf{Q}}\) to give

This condition ensures that a function such as \(\phi _i(x,y)\) and the same function rotated to the new reference, \(\phi ^\prime _i(x^\prime ,y^\prime )\), then have the same value in the norm induced by \(\textbf{M} + \textbf{Q}\).

A further symmetry condition is that, given a pair of flux points on a face that are symmetric about some axis, the corresponding correction functions should be symmetric. This gives the condition that

where *x* is the axis of symmetry and \(\tilde{\textbf{S}}_x\) is a matrix that reflects the modes about the axis *x*. A comparable axial symmetry condition was proposed by Ranocha et al. [10] for use in one-dimension. Finally, when applying symmetry conditions care must be taken to not over constrain the system. This occurs when one symmetry in the reference frame of a face is a linear combination of other symmetry conditions, and is often indicated by the erroneous recovery of \(\tilde{\textbf{Q}}:=0\). For the reference triangle this means that applying two rotational symmetries and one axial symmetry is over constrained as one rational symmetry can be expressed using the other rotation and the axial symmetry.

## 4 Extended-Range Scheme on Triangle

Vincent et al. [9] and Ranocha et al. [10] derived an extended range of energy stable 1D correction functions and the analysis presented in Sect. 3 derived the conditions required to extend this family to triangles. We now set out this generalised extended range of stable correction functions for several orders using the reference triangle shown in Fig. 1b. Furthermore, schemes will be defined in the modal form due to the sparsity of the matrices, and is supported by Corollary 3.5.

In this section we also look to recover the single parameter schemes of Castonguay et al. [1]. This set can be cast into the SBP framework with the following definition:

### Definition 4.1

(Castonguay et al. simplex method) Given the reference triangular element of Fig. 1b and a total order basis, FR is found to be stable in the broken Sobolev norm:

where \(A=|\hat{K}|\). This can then be used to define \(\tilde{\textbf{Q}}_\textrm{C}\) required to recover this set of methods in the extended range of stable schemes defined here. Therefore:

In what follows we will then look if and how this \(\tilde{\textbf{Q}}_C\) matrix be recovered in the new set of schemes defined, and what the constraints on *c* are for stability.

### 4.1 \(k=2\)

Setting \(k=2\) we can find that the modal correction mass matrix is:

From (3.15c) we have the requirement that \(\tilde{\textbf{M}}+\tilde{\textbf{Q}}\) is positive definite. This implies that the leading diagonal of a Cholesky factorisation of \(\tilde{\textbf{M}}+\tilde{\textbf{Q}}\) has to be real and positive, leading to the following conditions on stability:

The single parameter FR scheme of Definition 4.1 is then recovered for

which leads to the stability condition that

### 4.2 \(k=3\)

Setting \(k=3\) we can find that the modal correction mass matrix is:

with stability limits of:

The single parameter scheme of Definition 4.1 is then recovered with

subject to the stability condition that

As an example of how the correction functions are effected by \(\tilde{\textbf{Q}}\), consider Fig. 2 which shows the divergence of the DG correction field and Fig. 3 which shows the divergence of the correction field for \(\tilde{\textbf{Q}}(q_0=1,q_1=1,q_2=1)\).

### 4.3 \(k=4\)

Finally repeating this analysis for \(k=4\), we find the following definition of the \(\tilde{\textbf{Q}}\) matrix.

subject to the constraints on stability that:

The single parameter family of Definition 4.1 is then found as a subset when

with the stability condition of:

The procedure to find \(\tilde{\textbf{Q}}\) and the stability conditions can be generalised for arbitrary order using a symbolic manipulation tool. Performing analysis for higher orders, the stability conditions for the single parameter Castonguay et al. [1] can be tabulated as in Table 1. For \(k>5\) it is does not seem possible to get a closed expression for the stability limit as the value of *c* is the root of a high order polynomial. For example, at \(k=6\) the polynomial is order seven.

## 5 Spectral Difference Methods

The spectral difference (SD) method [31] is a high-order method similar to FR but with the flux evaluated at staggered set of points, analogous to the method of Kopriva and Kolias [32]. The nodal basis of the flux is then chosen such that it lies in the Raviart–Thomas [33] space of the approximation space.^{Footnote 1} This has the effect of elevating the flux function order, which has been found to give rise to better aliasing properties [34].

In the 1D linear case, SD can be found to be a member of the one parameter class of FR methods [6, 18]. Using the generalisation of Trojak and Witherden [18], the SD correction functions can be expressed as

Jameson [13] has previously shown that in 1D the only linearly stable SD scheme is that corresponding to \((\alpha ,\beta )=(0,0)\), i.e. the interior flux points are located at the Gauss–Legendre nodes. Trojak and Witherden [18] showed that Fourier analysis can be effectively used to find stable SD schemes with alternative point layouts for which linear stability proofs could not be constructed.

A long-standing difficulty has existed in defining linearly stable SD schemes on triangles. Schemes can be constructed for tensor product elements on a maximal order basis, such as quadrilaterals and hexahedrals. However, simplex elements have proven to be more difficult, with some schemes found via Fourier analysis that are stable under interface upwinding. The broad set of stable schemes outlined in Sect. 4 offers a promising route to find generally stable SD method.

### 5.1 One-Dimension

As an initial test of a procedure to find SD correction functions, we look to confirm the SD stability theorem of Jameson [13] in 1D. Here we assume that the interior flux points are placed symmetrically within an element, and when there is an odd number of interior points a single point is placed at the centre. A numerical version of this study has previously been performed by den Abeele et al. [35].

Using a point layout similar to the example shown in Fig. 4, the nodal representation of the 1D correction functions can be written as

for \(m=\lfloor p/2\rfloor \) and \(n=p\mod 2\). This can then be differentiated and transformed into a modal representation allowing for \(\tilde{\textbf{Q}}\) to be found via:

Here the interpolation operators have been factored out by using the DG correction matrix to give system that is more straightforwardly solved. For \(k=3\), we have \(m=1\) and \(n=1\), and we find \(\tilde{\textbf{Q}}\) as

However, from (3.15b) we have the additional constraint that \(q_1 = -5q_2/3\), which can only be satisfied if \(q_1=q_2=0\). This occurs when \(z_1=\pm \sqrt{3/5}\), which when combined with the flux point at \(x=0\), gives the interior flux points as the nodes of the Gauss–Legendre quadrature. This confirms the result of Jameson [13] and when \(z_1\) is substituted into \(q_0\) we find \(q_0=3/14\), as reported by Vincent et al. [9].

Repeating this for \(k=4\), we find that

Again using the condition of (3.15b), we find that \(q_i=0 \;\forall i\in \{1,\dots ,5\}\) which is achieved when

or vice versa. This again corresponds to the Gauss–Legendre quadrature and gives \(q_0=8/45\), corresponding to Vincent et al. [9].

### Remark 5.1

The point symmetry imposed and the irrelevance of the ordering of the zeros is why there are multiple solutions that give a valid \(\tilde{\textbf{Q}}\). The correction functions recovered from each is the same. This symmetry can be further identified from the form of the *q* terms and their lack odd powers of *z*.

### 5.2 Triangular Elements

Next we extend this procedure to triangles. From the work of Balan et al. [36], we start by defining the Raviart–Thomas (RT) space in two-dimensions as

which for \(k=2\) gives

In the FR method, the correction functions are within an RT space, and likewise the analogy of corrections in SD are within an RT space. For SD, this two-dimensional basis is then defined via a staggered or flux point set, \(\{\pmb {\sigma }\}\), and requires normals to be associated with each point, \(\textbf{n}_s\). An example of these flux points and there normal can be seen in Fig. 5. The Lagrange basis can then be defined via the Vandermonde as

where \(\textbf{V}_{\textrm{RT},x}\) and \(\textbf{V}_{\textrm{RT},x}\) are the Vandermonde matrices over \(\mathbb{R}\mathbb{T}_k\cdot [1,0]^T\) and \(\mathbb{R}\mathbb{T}_k\cdot [0,1]^T\) respectively. The Lagrange basis is then found from \(\textbf{V}_\textrm{RT}^{-1}\). Finally, the corrections are set using this basis where, from the definition of the SD method, the trace of the SD flux points are located at the FR flux points.

#### 5.2.1 \(k=1\)

The most straightforward SD method to define on simplex element is for \(k=1\). In this case a single interior flux point is required at the element centroid, with normals in *x* and *y*. This case was not considered in Sect. 4, but the extended range of stable schemes can be found to be:

The SD correction function is then found to be recovered when \(q_0=1/3\).

#### 5.2.2 \(k=2\)

We now consider \(k=2\), here the number of flux points is 15, but this can be reduced to 12 degrees of freedom by repeating the interior flux point with orthogonal normals [36]. Similar to the method used in one-dimension, we parameterise the interior flux point locations by \(z_1\), which can be placed using Barycentric coordinates in a manner ensuring rotational symmetry, see Fig. 5c.

Using this construction, the following matrix can be formed:

where a \(\tilde{\textbf{Q}}\) compatible with Subsect. 4.1 is sought such that \(\tilde{\textbf{A}}=0\). It was shown by Balan et al. [36] that the stability of the method is independent of the boundary flux point locations, at least for linear equations, and so to reduce the complexity of the resulting matrices we place these points in an equispaced configuration. Focusing on the value of \(\tilde{\textbf{A}}_{0,0}\) we find that

It is clear that there is no value of \(z_1\in [0,1/2]\) that can satisfy \(\tilde{\textbf{A}}_{0,0}=0\).

The assumption of collocated interior flux points can be relaxed and a second parameter \(z_2\) can be introduced. Repeating the procedure above now with two variables, likewise no pair of variables, \((z_1,z_2)\), can be found for a norm in this class for which the energy monotonically decays in time. For brevity, a full display of the contradictions encountered is not given.

### 5.3 \(k=3\)

For \(k=3\), assuming collocated interior flux points, there are six degrees of freedom. For symmetric placement of these points there are two possible choices of orbits (0, 2, 0) and (0, 0, 1), based on the work of Witherden and Vincent [15], i.e. two three-point orbits (parameterised by \(z_1\) and \(z_2\)) or one six-point orbit (also parameterised by \(z_1\) and \(z_2\)). Examples of these orbits are shown in Fig. 5b and c.

Starting with the (0, 2, 0) configuration, we again use the result of Balan et al. [12] that stability is independent of the boundary flux point location and use equispaced boundary flux points. Forming the Raviart–Thomas space and finding \(\tilde{\textbf{A}}\), we find from the second column of \(\tilde{\textbf{A}}\) that

and a second solution with \(z_1\) and \(z_2\) swapped. Substituting these into \(\tilde{\textbf{A}}\) and studying the first column of \(\tilde{\textbf{A}}\), we see this leads to the contradiction of

Therefore, there is no \(k=3\) SD scheme with the interior flux points in the configuration (0, 2, 0) that is a form of filtered DG.

Repeating this for interior flux points in the orbit (0, 0, 1), we find in the first column of \(\tilde{\textbf{A}}\) that

Clearly this does not satisfy the condition that \(\tilde{\textbf{A}}=0\), from which we can draw the conclusion that there is no stable \(k=3\) SD scheme, in either (0, 2, 0) or (0, 0, 1), that is a form of filtered DG. Examples of the matrices defined here can be found in Sect. B.

### Remark 5.2

This instability is similar to a finding presented by den Abeele et al. [35], however, in that work only Fourier analysis was used to explore stability. Stable schemes where found by Veilleux et al. [14] and Balan et al. [36] using Fourier analysis, however, in that analysis interface upwinding was required to find stable schemes. Therefore, they are not strictly linearly stable.

Summarising, we found a linearly stable SD scheme for \(k=1\). However, it was shown that for \(k=2\) and \(k=3\) no SD scheme exists in this set of linearly stable FR methods. For \(k>3\), no attempt was made to solve (5.3) due to the complexity of the algebra, therefore we are not able to say definitively if stable SD schemes exist in these cases. These results, combined with those of Balan et al. [36], den Abeele et al. [35], and Veilleux et al. [14], suggest that it will be challenging to find linearly stable SD scheme for \(k>1\) on triangles.

## 6 Numerical Experiments

To perform a numerical evaluation of the schemes defined here we considered the Euler vortex case [37], a two-dimensional test case for the Euler equations. A periodic domain \(\Omega =[-10,-10]^2\) subdivided into \(2(n_x-1)^2\) regular right-angles triangles was used, see Fig. 6. The system of equations was then

for pressure *P* and energy *E*, and the initial condition was set as:

where *M* is the Mach number, \(\beta \) is the vortex strength, and *R* is the vortex width, set as 0.4, 13.5, and 1.5 respectively. The error with time can then be calculated for a series of meshes, specifically we used the definition of \(L_1\) and \(L_2\) error of

where the integrals are approximated with a degree 23 quadrature.

In these tests, solution points were positioned at the quadrature points defined by Williams et al. [38]. The common interface flux was calculated using a Rusanov flux and Einfeldt wavespeed predictions [39] at flux points located with the Gauss–Legendre quadrature. For time integration, a standard explicit RK4 method was used. Results for \(k=3\) are presented in Table 2 for \(\textbf{Q}=0\), \(\textbf{Q}_1(q_0=0.1,q_1=0.1,q_2=0.01)\), and \(\textbf{Q}_2(q_0=0,q_1=0,q_2=0.1)\). Here a constant time step of \(\Delta t=5\times 10^{-3}\) was used and the \(L_1\) and \(L_2\) error is calculated at \(t=100\). Table 3 shows the results for the test repeated for \(k=4\), with \(\textbf{Q}=0\), \(\textbf{Q}_1(q_0=0.01,q_1=0.01,q_2=0.01,q_3=0.01)\), and \(\textbf{Q}_2(q_0=0.1,q_1=0,q_2=0,q_3=0)\). At \(k=4\) a constant time step of \(\Delta t=2\times 10^{-3}\) was used, again with error calculated at \(t=100\). These data show that the correction functions tested were stable for \(t\in [0,100]\) and furthermore the expected order of accuracy was recovered. The variation in error is evidence of the changing numerical properties caused by varying the correction function.

## 7 Conclusion

A new multi-parameter set of stable flux reconstruction (FR) methods on triangles was constructed by using the summation-by-parts framework. The correction functions of Castonguay et al. [1] were found to be a subset of this new stable set of FR methods, moreover we were able to successfully expand the stability region of Castonguay et al. [1]. Using this new set of FR methods, we investigated if stable SD methods could be defined within it. We found that a stable SD scheme could be produced for \(k=1\) and that none can be produced in this set of FR methods for \(k=2\) and \(k=3\). Numerical experiments were performed for a number of the correction functions outlined in this work and it was shown that the desired order of accuracy was recovered. The approaches outlined here can be used to find similar sets of methods on other element topologies which will be the subject of future work.

## Data availability

The data that support the findings of this study are available from the corresponding author upon reasonable request.

## Notes

For this reason SD is sometimes referred to as Raviart–Thomas SD.

## References

Castonguay, P., Vincent, P.E., Jameson, A.: A new class of high-order energy stable flux reconstruction schemes for triangular elements. J. Sci. Comput.

**51**(1), 224–256 (2011). https://doi.org/10.1007/s10915-011-9505-3Huynh, H.T.: A flux reconstruction approach to high-order schemes including discontinuous galerkin methods. In: 18th AIAA Computational Fluid Dynamics Conference. American Institute of Aeronautics and Astronautics, (June 2007). https://doi.org/10.2514/6.2007-4079

Vincent, Peter, Witherden, Freddie, Vermeire, Brian, Park, Jin Seok, Iyer, Arvind: Towards green aviation with python at petascale. In: SC16: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, (November 2016). https://doi.org/10.1109/sc.2016.1

Reed, W.H., Hill, T.R.: Triangular mesh methods for the neutron transport equation. 10 (1973). URL https://www.osti.gov/biblio/4491151

Making it work in one dimension, pages 43–74. Springer New York, New York, NY, (2008). ISBN 978-0-387-72067-8. https://doi.org/10.1007/978-0-387-72067-8_3

Vincent, P.E., Castonguay, P., Jameson, A.: A new class of high-order energy stable flux reconstruction schemes. J. Sci. Comput.

**47**(1), 50–72 (2010). https://doi.org/10.1007/s10915-010-9420-zAllaneau, Y., Jameson, A.: Connections between the filtered discontinuous galerkin method and the flux reconstruction approach to high order discretizations. Comput. Methods Appl. Mech. Eng.

**200**(49–52), 3628–3636 (2011). https://doi.org/10.1016/j.cma.2011.08.019Zwanenburg, P., Nadarajah, S.: Equivalence between the energy stable flux reconstruction and filtered discontinuous galerkin schemes. J. Comput. Phys.

**306**, 343–369 (2016). https://doi.org/10.1016/j.jcp.2015.11.036Vincent, P.E., Farrington, A.M., Witherden, F.D., Jameson, A.: An extended range of stable-symmetric-conservative flux reconstruction correction functions. Comput. Methods Appl. Mech. Eng.

**296**, 248–272 (2015). https://doi.org/10.1016/j.cma.2015.07.023Ranocha, H., Öffner, P., Sonar, T.: Summation-by-parts operators for correction procedure via reconstruction. J. Comput. Phys.

**311**, 299–328 (2016). https://doi.org/10.1016/j.jcp.2016.02.009Williams, D.M., Castonguay, P., Vincent, P.E., Jameson, A.: Energy stable flux reconstruction schemes for advection–diffusion problems on triangles. J. Comput. Phys.

**250**, 53–76 (2013). https://doi.org/10.1016/j.jcp.2013.05.007Balan, A., May, G., Schöberl, J.: A stable spectral difference method for triangles. In 49th AIAA Aerospace Sciences Meeting including the New Horizons Forum and Aerospace Exposition. American Institute of Aeronautics and Astronautics, (January 2011). https://doi.org/10.2514/6.2011-47

Jameson, A.: A proof of the stability of the spectral difference method for all orders of accuracy. J. Sci. Comput.

**45**(1–3), 348–358 (2010). https://doi.org/10.1007/s10915-009-9339-4Veilleux, A., Puigt, G., Deniau, H., Daviller, G.: A stable spectral difference approach for computations with triangular and hybrid grids up to the 6 order of accuracy. J. Comput. Phys.

**449**, 110774 (2022). https://doi.org/10.1016/j.jcp.2021.110774Witherden, F.D., Vincent, P.E.: On the identification of symmetric quadrature rules for finite element methods. Comput. Math. Appl.

**69**(10), 1232–1241 (2015). https://doi.org/10.1016/j.camwa.2015.03.017Wang, L., Yu, M.: Comparison of ROW, ESDIRK, and BDF2 for unsteady flows with the high-order flux reconstruction formulation. J. Sci. Comput. (2020). https://doi.org/10.1007/s10915-020-01222-z

Vincent, P.E., Castonguay, P., Jameson, A.: Insights from von neumann analysis of high-order flux reconstruction schemes. J. Comput. Phys.

**230**(22), 8134–8154 (2011). https://doi.org/10.1016/j.jcp.2011.07.013Trojak, W., Witherden, F.D.: A new family of weighted one-parameter flux reconstruction schemes. Comput. Fluids

**222**, 104918 (2021). https://doi.org/10.1016/j.compfluid.2021.104918Gautschi, W.: Construction of gauss-christoffel quadrature formulas. Math. Comput.

**22**(102), 251–270 (1968). https://doi.org/10.1090/s0025-5718-1968-0228171-0Trojak, William: Numerical Analysis of Flux Reconstruction. PhD thesis, University of Cambridge, Cambridge, 4 (2019)

Dubiner, M.: Spectral methods on triangles and other domains. J. Sci. Comput.

**6**(4), 345–390 (1991). https://doi.org/10.1007/bf01060030Trefethen, L.N.: Multivariate polynomial approximation in the hypercube. Proc. Am. Math. Soc.

**145**(11), 4837–4844 (2017). https://doi.org/10.1090/proc/13623Fisher, T.C., Carpenter, M.H.: High-order entropy stable finite difference schemes for nonlinear conservation laws: Finite domains. J. Comput. Phys.

**252**, 518–557 (2013). https://doi.org/10.1016/j.jcp.2013.06.014Carpenter, M.H., Otto, J.: High-order “cyclo-difference’’ techniques: An alternative to finite differences. J. Comput. Phys.

**118**(2), 242–260 (1995). https://doi.org/10.1006/jcph.1995.1096Olsson, P.: Summation by parts, projections, and stability. i. Math. Comput.

**64**(211), 1035–1065 (1995). https://doi.org/10.1090/s0025-5718-1995-1297474-xCarpenter, M.H., Gottlieb, D., Abarbanel, S.: Time-stable boundary conditions for finite-difference schemes solving hyperbolic systems: Methodology and application to high-order compact schemes. J. Comput. Phys.

**111**(2), 220–236 (1994). https://doi.org/10.1006/jcph.1994.1057Del Rey, F., David, C., Boom, P.D., Carpenter, M.H., Zingg, D.W.: Extension of tensor-product generalized and dense-norm summation-by-parts operators to curvilinear coordinates. J. Sci. Comput.

**80**(3), 1957–1996 (2019). https://doi.org/10.1007/s10915-019-01011-3Hicken, J.E., Del Rey, F., David, C., Zingg, D.W.: Multidimensional summation-by-parts operators: General theory and application to simplex elements. SIAM J. Sci. Comput.

**38**(4), A1935–A1958 (2016). https://doi.org/10.1137/15m1038360Del Rey F., David C., Boom, P.D., Zingg, D.W.: A generalized framework for nodal first derivative summation-by-parts operators. J. Comput. Phys. 266: 214–239 (2014). https://doi.org/10.1016/j.jcp.2014.01.038

Chan, J.: On discretely entropy conservative and entropy stable discontinuous galerkin methods. J. Comput. Phys.

**362**, 346–374 (2018). https://doi.org/10.1016/j.jcp.2018.02.033Liu, Y., Vinokur, M., Wang, Z.J.: Spectral difference method for unstructured grids i: Basic formulation. J. Comput. Phys.

**216**(2), 780–801 (2006). https://doi.org/10.1016/j.jcp.2006.01.024Kopriva, D.A., Kolias, J.H.: A conservative staggered-grid chebyshev multidomain method for compressible flows. J. Comput. Phys.

**125**(1), 244–261 (1996). https://doi.org/10.1006/jcph.1996.0091Raviart, P.A., Thomas, J.M.: A mixed finite element method for 2-nd order elliptic problems. In Lecture Notes in Mathematics, pp. 292–315. Springer, Berlin, Heidelberg, (1977). https://doi.org/10.1007/bfb0064470

Cox, C., Trojak, W., Dzanic, T., Witherden, F.D., Jameson, A.: Accuracy, stability, and performance comparison between the spectral difference and flux reconstruction schemes. Comput. Fluids

**221**, 104922 (2021). https://doi.org/10.1016/j.compfluid.2021.104922Van den Abeele, K., Lacor, C., Wang, Z.J.: On the stability and accuracy of the spectral difference method. J. Sci. Comput.

**37**(2), 162–188 (2008). https://doi.org/10.1007/s10915-008-9201-0Balan, A., May, G., SchÖberl, J.: A stable high-order spectral difference method for hyperbolic conservation laws on triangular elements. J. Comput. Phys.

**231**(5), 2359–2375 (2012). https://doi.org/10.1016/j.jcp.2011.11.041Shu, Chi-Wang: Essentially non-oscillatory and weighted essentially non-oscillatory schemes for hyperbolic conservation laws. In: Lecture notes in mathematics, pp. 408–409. Springer, Berlin Heidelberg, (1998). https://doi.org/10.1007/bfb0096355

Williams, D.M., Shunn, L., Jameson, A.: Symmetric quadrature rules for simplexes based on sphere close packed lattice arrangements. J. Comput. Appl. Math.

**266**, 18–38 (2014). https://doi.org/10.1016/j.cam.2014.01.007Einfeldt, B.: On godunov-type methods for gas dynamics. SIAM J. Numer. Anal.

**25**(2), 294–318 (1988). https://doi.org/10.1137/0725021

## Funding

This work was supported by the Engineering and Physical Sciences Research Council (Grant No. EP/R030340/1).

## Author information

### Authors and Affiliations

### Corresponding author

## Ethics declarations

### Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Supplementary Information

Below is the link to the electronic supplementary material.

## Appendices

### Appendix—Weak Quadratures

To build the correction matrices defined in Lemma 3.2 a mass matrix is required, and it is often more practicable to produce this via quadrature rather than explicitly integrating the Lagrange basis. Yet, for triangular elements it is rarely possible to find a quadrature with both: sufficient strength to integrate the basis adequately and the same number of points as there are basis functions. For example, the quadrature rules of Williams et al. [38] have \((k+1)(k+2)/2\) points but are not sufficiently accurate to integrate \(\mathbb {Q}_{2k-1}\), as required for SBP to be valid. Instead, a more accurate quadrature like that of Witherden and Vincent [15] can be used; however, these have more points. This poses a problem when calculating the correction function matrices within an implementation of FR as either the lumped mass matrix is insufficiently accurate or the Vandermonde matrix is not square.

The solution is to use an \(L_2\) projection with an intermediate set of points whose quadrature is sufficiently strong to integrate the basis. First consider the definition of the \(L_2\) projection operators.

### Definition A.1

(\(L_2\) projection) For a nodal point set \(\{\pmb {\zeta }_i\}_{i\le N_q}\) defining some polynomial basis \(Q\in \mathbb {Q}_q\) with an associated quadrature \(\{\pmb {\omega }_i\}_{i\le N_q}\) of strength at least \(2q-1\), and a point set \(\{\textbf{x}_i\}_{i\le N_k}\) defining \(R\in \mathbb {Q}_k\) such that \(N_q > N_k\) and \(q>k\), then the \(L_2\) projection matrix from *Q* to *R* is then

where \(\textbf{P}_{qk}\) is the prolongation matrix that interpolates from *R* to *Q*.

It is often more practical to set \(\tilde{\textbf{Q}}\) due to its sparser form. Therefore, we have the following lemma on the use of weaker quadratures:

### Lemma A.2

(Weak quadrature) For a linear flux \(\textbf{F}\), assuming the surface quadrature is accurate to degree 2*k* and that conditions (3.3), (3.4), and (3.15) are satisfied modally for some \(\tilde{\textbf{Q}}\), then let \(\{\omega _i\}\) be some quadrature that is sufficiently strong. Then the condition on stability becomes

where \(\textbf{M}_q=\textrm{diag}(\omega )\) and the \(L_2\) projection and restriction matrices are defined as in Definition A.1.

### Proof

Starting from the statement of the FR method we have

To integrate with sufficient accuracy we wish to use \(\textbf{M}_q + \textbf{Q}_q\), therefore we multiply by \(\textbf{u}^T\textbf{P}_{qk}^T(\textbf{M}_q + \textbf{Q}_q)\textbf{P}_{qk}\) to obtain

As before we require

for stability. By definition, we have \(\textbf{P}_{qk}^T\textbf{M}_q\textbf{P}_{qk}\textbf{R}_{qk}\textbf{M}_q^{-1}\textbf{R}_{qk}^T=\textbf{I}\) and hence we obtain

Finally, the definition of \(\textbf{Q}_q=(\textbf{V}^{-1}\textbf{R}_{qk})^T\tilde{\textbf{Q}}\textbf{V}^{-1}\textbf{R}_{qk}\) follows naturally. This concludes the proof. \(\square \)

### Appendix—Example Matrices

Below we include the modal form of key matrices for \(k=2\). Additional example matrices for SD and \(k=3\) are available as supplementary material.

## Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

## About this article

### Cite this article

Trojak, W., Vincent, P. An Extended Range of Energy Stable Flux Reconstruction Methods on Triangles.
*J Sci Comput* **96**, 32 (2023). https://doi.org/10.1007/s10915-023-02258-7

Received:

Revised:

Accepted:

Published:

DOI: https://doi.org/10.1007/s10915-023-02258-7