Abstract
This paper investigates the connections between many popular variants of the wellestablished discontinuous Galerkin method and the recently developed highorder flux reconstruction approach on irregular tensorproduct grids. We explore these connections by analysing three nodal versions of tensorproduct discontinuous Galerkin spectral element approximations and three types of flux reconstruction schemes for solving systems of conservation laws on irregular tensorproduct meshes. We demonstrate that the existing connections established on regular grids are also valid on deformed and curved meshes for both linear and nonlinear problems, provided that the metric terms are accounted for appropriately. We also find that the aliasing issues arising from nonlinearities either due to a deformed/curved elements or due to the nonlinearity of the equations are equivalent and can be addressed using the same strategies both in the discontinuous Galerkin method and in the flux reconstruction approach. In particular, we show that the discontinuous Galerkin and the flux reconstruction approach are equivalent also when using higherorder quadrature rules that are commonly employed in the context of over or consistentintegrationbased dealiasing methods. The connections found in this work help to complete the picture regarding the relations between these two numerical approaches and show the possibility of using over or consistentintegration in an equivalent manner for both the approaches.
1 Introduction
Popularity of highorder compact discretisations using spectral/hp element spatial approximations is rising rapidly and their deployment to industrialtype problems is becoming a real possibility. Spectral/hp methods can achieve an arbitrary order of accuracy and they are significantly less dissipative than the more traditional loworder methods making them a key tool in some areas of computational fluid dynamics, such as in the numerical simulation of unsteady flows. On the other hand, spectral/hp element discretisations are still affected by a lack of numerical stability which makes them not highly reliable unlike loworder methods. One of the most popular approaches to discretise hyperbolic conservation laws is based on the discontinuous Galerkin (DG) method firstly introduced by Reed and Hill [1]. Usually, the DG method is formulated in a weak form where the domain is divided into nonoverlapping elements and on each of these elements a basis of polynomials and a set of quadrature points are chosen to calculate the integrals arising from the weak formulation of the problem. Some of the most efficient and ubiquitous forms of the DG method are the socalled nodal DG schemes, whereby Lagrange interpolants are combined with a set of nodal solution points on a given element [2]. We note that in a general nodal DG scheme, given an expansion on each element in terms of P Lagrange interpolants, we may perform quadrature on a separate set of Q quadrature points. If \(P=Q\) and the distribution of solution and quadrature points is identical, then we recover the socalled discontinuous Galerkin spectral element method (DG\(_{\text {SEM}}\)) which diagonalises the mass matrix, allowing for further computational optimisation [3, 4].
In contrast to the DG method which makes use of a weak representation of the equations, a set of schemes based upon the differential formulation have been recently introduced. They offer another route which avoids the need for calculating integrals and therefore defining quadrature rules, making these schemes attractive from an implementation point of view. The first of these, namely the spectraldifference scheme, was introduced by Kopriva and Kolias [5] in 1996 and was extended to quadrilateral and triangular elements by Liu et al. [6] in 2006. Most recently, the flux reconstruction (FR) method was presented by Huynh [7].
The FR approach encapsulates various energy stable discretisations where the particular scheme recovered is dictated by a single realvalued parameter and is referred as Vincent–Castonguay–Jameson–Huynh (VCJH) scheme [8]. The FR approach allows one to recover not only differentialtype schemes such as a particular SD method, but also integraltype schemes such as nodal DG schemes.
A general connection between FR and nodal DG schemes has already been examined in other works [7–9]. A more detailed inspection of the connections between these two schemes was carried out in [10] where it has been shown how for linear and nonlinear advection equations various equivalences exist between DG and FR schemes on regular grids. However, the extension to irregular meshes and the associated aliasing issues have not yet been explored. We consider a nodal DG scheme with \(Q > P\) and two DG\(_{\text {SEM}}\) schemes. In the following with the subscript SEM^{Footnote 1} we mean that a collocation quadrature rule is used for the inner product of the advection term of the conservation law equation.
The relationships found in this paper are summarized in Table 1. In particular, we demonstrate that the equivalences found in [10] between the DG\(_{\text {SEM}}\) scheme with lumped mass matrix (LMM) and the FR\(_{\text {HU}}\) scheme introduced in [7] (also referred to as FR\(_{\text {g2}}\)) as well as the equivalences between the DG\(_{\text {SEM}}\) scheme with exact mass matrix (EMM)^{Footnote 2} and the FR\(_{\text {DG}}\) scheme (also presented in [7]) hold true for irregular tensorproduct meshes (i.e. deformed/curved tensorproduct grids). These equivalences are complemented with some numerical experiments on regular (used as a baseline) and irregular grids for linear and nonlinear problems.
We also show numerically that, using \(Q>P\), where Q is the number of quadrature points and P are the Lagrange interpolants inside each element, further extends the equivalences between DG and FR\(_{\text {DG}}\). Specifically, we found that DG\(_{(\text {Q}\,>\,\text {P})}\) and FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) are identical when using \(Q>P\) for linear and nonlinear flux functions as well as for regular and irregular tensorproduct meshes^{Footnote 3}. This indicates that polynomial aliasing sources for these two schemes are identical and can therefore be addressed using equivalent strategies, such as the consistent integration (through additional quadrature points) of the nonlinearities arising either from the equations themselves or from the geometry [11, 12].
We finally present some results related to the computational time required by the FR and DG schemes.
This paper is organised as follows. In Sect. 2 we prove theoretically the connections in the first four columns of Table 1, in Sect. 3 we further assess the theoretical work with some numerical experiments for both linear and nonlinear problems and we show numerically how DG\(_{(\text {Q}\,>\,\text {P})}\) and FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) are identical and, finally, in Sect. 4 we draw the conclusions.
2 Theory
We describe the DG and FR schemes in the context of a 2D scalar conservation law. We assume that the quadrilateral elements are deformed/curved (i.e. possess spatially varying Jacobians) and we prove that the FR\(_{\text {DG}}\) scheme and DG\(_{\text {SEM}}\) method with an exact mass matrix evaluation are equivalent on irregular grids (i.e. spatially varying Jacobians) when the same polynomial approximation of the geometry is employed. We also demonstrate that the FR\(_{\text {HU}}\) scheme and the DG\(_{\text {SEM}}\) method with lumped mass matrix are equivalent on irregular quadrilateral grids.
2.1 2D Scalar Conservation Law on Irregular Quadrilateral Grids
Consider the following 2D conservation law
within a domain \(\Omega \in \mathbb {R}^{2}\), with \(\varvec{f} = (f,g)\), where \(f = f(u)\) and \(g = g(u)\) are the advection fluxes in the x and y directions respectively. The domain \(\Omega \) is partitioned into N nonoverlapping, quadrilateral elements \(\Omega _{n}\) which can be deformed or curved
Each quadrilateral element \(\Omega _{n}\) can be mapped into a reference quadrilateral \(\Omega _{s} = [1,1]^2\) in the transformed space \({\widehat{\varvec{x}}} = (\xi , \eta )\) using the generic mapping
In the case of curvilinear elements we can use the standard isoparametric mapping which, for an arbitraryshaped curvedsided twodimensional element, is:
where \(\phi _p\) and \(\phi _q\) are the same basis functions used for representing the solution. Analogous mappings can be adopted for threedimensional curvilinear elements. For additional details the interested reader can refer to [13].
2.2 FR\(_{\text {DG}}\) Scheme as DG\(_{\text {SEM}}\) Method with EMM
To demonstrate that the DG method is identical to FR\(_{\text {DG}}\) in the case of irregular grids we start multiplying Eq. (1) by a twodimensional Lagrange polynomial \(\ell (\varvec{x})\) and integrating the equation over a local element \(\Omega _{n}\)
where \(\varvec{f}^{\delta }_{n}\) is the elemental polynomial flux function and \(u_{n}^{\delta }\) is the elemental polynomial solution. We successively perform an integration by parts, substitute the boundary terms by the numerical interface fluxes and integrate by parts once more in order to derive the strong form of the DG method
where \(\varvec{n}\) is the normal, \(\varvec{f}^{\delta I}_{n}\) is the numerical interface flux and the superscript D indicates discontinuous polynomial flux functions which are directly evaluated at the solution points. We now substitute the operations on the local element \(\Omega _{n}\) onto the reference element \(\Omega _{s}\) in order to highlight the metric terms
where \({\widehat{\varvec{b}}}_{DG_{n}}\) is the boundary term which couples the elements of the spatial discretisation together. We can reexpress Eq. (7) in a form more amenable to implementation and which keeps all the geometric terms as standard polynomials as:
where we used the following relationships
The expression of \({\widehat{\varvec{b}}}_{DG_{n}}\) on the reference element \(\Omega _{s}\) depends on the edge considered and for the bottom edge is
where
Using similar relations for the other three edges of \(\Omega _{s}\), Eq. (12) becomes
We now consider the FR\(_{\text {DG}}\) approach where we define the following transformations between the local element \(\Omega _{n}\) and the reference element \(\Omega _{s}\):
where the polynomial metric terms \(J_{2D_{n}}, \frac{\partial x}{\partial \xi }, \frac{\partial x}{\partial \eta }, \frac{\partial y}{\partial \xi }, \frac{\partial y}{\partial \eta }\) can be evaluated, for instance, from Eq. (4). The FR approach in a reference element can be written as
We now expand Eq. (13) as follows
where \({\widehat{\varvec{b}}}_{FR_{n}}\) is defined as
with \(\Psi _{i}^{\prime }\) being the derivatives of the correction functions which will be defined later. For the bottom edge of the reference quadrilateral element we can write
where \({\widehat{\varvec{n}}}_{0}= (0, 1)\) and \(\varvec{G}^{1}\) and \(J_{2D_{n}}\) are defined in Eq. (9). Note that the relation in Eq. (16) is necessary to transform the flux jump from the physical space to the reference element (for additional details see [14]). As final form we obtain
Using similar relations for the other edges of the reference quadrilateral element, Eq. (14) becomes
Now we require the residual to be orthogonal to a set of smooth functions
where we used the relation \(\ell (\varvec{\xi }) = \ell _{i}(\xi )\ell _{j}(\eta )\). As shown by Huynh [7]:
where \(\Psi _{3}\) and \( \Psi _{0}\) are the right Radau polynomials of order \(P + 1\) on \([1, 1]\) which vanish at the right and top edges \(\xi = \eta = 1\). This is due to the orthogonality of the right Radau polynomial of order \(P + 1\) to all polynomials of order up to \(P  1\). Analogously, we can write
where \( \Psi _{1}\) and \( \Psi _{2}\) are the left Radau polynomials of order \(P + 1\) on \([1, 1]\) which vanish at the left and bottom edges \(\xi = \eta = 1\). Substituting Eqs. (20) and (21) in Eq. (19) we obtain
which is identical to Eq. (12) and proves the statement.
Remark
The equivalence above holds true for any point distribution used for defining the Lagrange basis.
2.3 FR\(_{\text {HU}}\) Scheme as DG\(_{\text {SEM}}\) Method with LMM
Consider Eq. (12) with solution coefficients represented by Lagrange polynomials at \((P + 1)\times (P + 1)\) GLL points. If we additionally choose a GLL quadrature for the DG\(_{\text {SEM}}\) scheme, it is well known that only polynomials up to order \(2P  1\) are exactly integrated (to machine precision). The associated elemental mass matrix
will contain a numerical quadrature error since each integrand is a polynomial of order 2P. However, because the Lagrangian basis possesses the property that \(\ell _{m}(\xi _{n}) = \delta _{m,n}\) where \(\delta _{m,n}\) represents the Kronecker delta function, this quadrature rule gives a diagonal mass matrix, \(\mathbf {M} = diag(w_{i,j} J_{2D_{n_{i,j}}})\), where \(w_{i,j}\) are the weights of the GLL quadrature rule. With this quadrature rule the boundary integrals simplify and each flux jump modifies only its own boundary (edge) solution point. Equation (19) can therefore be written as
If we now consider a collocation quadrature rule with solution values located at GLL points we obtain the same diagonal mass matrix as before, \(\mathbf {M} = diag(w_{i,j} J_{2D_{n_{i,j}}})\). The volumetric integrals associated to Eqs. (12) and (19) are evaluated in the same way and, therefore, in order for the two schemes to be the same we need to find a correction function which transforms the FR boundary term into the DG one. Specifically, if we use as correction functions those recovering the FR\(_{\text {HU}}\) scheme, which can be found in [8], their derivatives vanish at all solution points except at the left/bottom edges if evaluating \(\Psi _{3}^{\prime }(\xi ) \, / \, \Psi _{0}^{\prime }(\eta )\) or at the right/top edges if evaluating \(\Psi _{1}^{\prime }(\xi ) \, / \, \Psi _{2}^{\prime }(\eta )\) (the zeros of \(\Psi ^{\prime }\) are at GLL points). Thus, in the FR\(_{\text {HU}}\) scheme the corrective flux modifies only the edge points. We can adopt the following transformation:
because the derivatives of the correction functions in vector form evaluated at the \((P+1)\times (P+1)\) GLL points are the following:
The boundary term of FR\(_{\text {HU}}\) scheme is equal to the boundary term of the DG\(_{\text {SEM}}\) scheme with lumped mass matrix and therefore the two schemes are equivalent.
Remark
Note that this equivalence holds true only for GLL points.
3 Numerical Experiments
In this section we present the numerical results obtained for both linear and nonlinear problems. We used two different mesh configurations: a singleelement mesh (also referred as Mesh A) whose Jacobian determinant is shown in Fig. 1 and a multielement mesh (also referred as Mesh B) whose Jacobian determinants are depicted in Fig. 2. The curved edges in Mesh A are described through a parabolic function \(f_{1}\), which, defined within a onedimensional reference element, is
where \(A_{1}\) is a constant which determines the amplitude of the deformation and was set to zero for the mesh in Fig. 1a (i.e. we obtained a regular mesh), while for the meshes in Fig. 1b, c \(A_{1}\) was equal to 0.2 and 0.4 respectively.
Mesh B was generated using a sinusoidal function \(f_{2}\)
where \(A_{2}\) is a constant which set the deformation amplitude and was set to zero for the mesh in Fig. 2a (i.e. we obtained a regular mesh), while for the meshes in Fig. 2b, c \(A_{2}\) was equal to 0.1 and 0.2 respectively. Note that similar meshes were used in [15] for studying the accuracy and efficiency of several discontinuous highorder formulations on curved quadrilateral elements.
For both mesh configurations we tested the linear advection equation and the nonlinear compressible Euler equations. The test cases considered span all the possible combinations in Table 1.
We tested two different set of points, Gauss–Lobatto–Legendre (GLL) and Gauss–Legendre (GL) where the interpolations required at the boundaries for GL points were performed in a consistent manner for the various DG and FR schemes considered. Note that we show the results for the regular and most deformed grids on GLL points only for the sake of brevity. The conclusions we can draw from the results obtained on GL points and on the grids in the Figs. 1b and 2b are identical to those which can be drawn from the results presented here. Some additional results concerning GL points and the two grids in the Figs. 1b and 2b are reported in the “Appendix”.
Throughout the numerical results we will make extensive use of relative L\(^{2}\) errors defined as
where \(u_{i}\) is the numerical solution calculated at each quadrature point, \(u_{i,exact}\) is the exact solution and N is the total number of quadrature points and \(w_{i}\) are the weights.
3.1 Linear Problem
The first series of numerical experiments was carried out on the twodimensional linear advection equation
where \(\tau _{x} = \tau _{y} = 2\) for Mesh A in Fig. 1 and \(\tau _{x} = \tau _{y} = 0.5\) for Mesh B in Fig. 2. The initial conditions were applied using a collocation projection for FR\(_{\text {HU}}\), DG\(_{\text {SEM}}\), FR\(_{\text {DG}}\) while we used a higher order projection (employing an additional quadrature point) for FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\). For both mesh configurations, we applied exact boundary conditions and an explicit 4thorder Runge–Kutta scheme for the timeintegration with a final time \(T = 2s\) and a timestep sufficiently small to consider the temporal error negligible. We employed four different polynomial orders to discretise the solution. Specifically, for the meshes in Fig. 1 we used \(P = 10, 11, 12\) and 13, whilst, for the meshes in Fig. 2, we applied \(P = 5, 6, 7\) and 8. The main parameters used are summarized in Table 2.
3.1.1 Mesh A
Figure 3 represents the L\(^{2}\) error vs the polynomial order obtained using GLL points for the various schemes tested where Fig. 3a refers to the regular mesh represented in Figs. 1a and 3b refers to the mesh depicted in Fig. 1c. Table 4 in the “Appendix” quantifies up to sixteen digits the results obtained for \(P=10\), for both GLL and GL points and all the three grids in Fig. 1. The results for the other polynomial orders are not tabulated for the sake of compactness and because they provide the same information as those which can be obtained from Table 4.
The following equivalences hold true for all the polynomial orders considered:

FR\(_{\text {HU}}\) and DG\(_{\text {SEM}}\) with lumped mass matrix on GLL points;

FR\(_{\text {DG}}\) and DG\(_{\text {SEM}}\) with exact mass matrix on any point distribution;

FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\) on any point distribution.
The first two results confirm the demonstrations presented in the previous section. In addition, the last result indicates that these connections are valid also when using additional quadrature points than a standard collocated spectral/hp element method. Also, the equivalences are up to machine precision for all the deformation levels considered as shown in Table 4.
From a polynomial aliasing perspective, where the polynomial aliasing is introduced by the curved geometry, it is interesting to note how the magnitude of the error increases as the deformation level of the mesh increases. Specifically, we can see that using either FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) or DG\(_{(\text {Q}\,>\,\text {P})}\) provides a different result (generally a better L\(^{2}\) error) for the deformed meshes.^{Footnote 4}
3.1.2 Mesh B
Figure 4 represents the L\(^{2}\) error vs the polynomial order obtained using GLL points for the various schemes tested, where Fig. 4a refers to the regular mesh represented in Figs. 2a and 4b refers to the mesh in Fig. 2c. Table 5 in the “Appendix” quantifies up to sixteen digits the results obtained for both GLL and GL points for \(P=5\) and all the three grids in Fig. 2. The connections presented for the singleelement mesh configuration in the previous subsection hold true also for the multielement mesh configuration.
From a polynomial aliasing point of view it is possible to note how the differences between the pairs FR\(_{\text {DG}}\), DG\(_{\text {SEM}}\) with exact mass matrix and FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\), DG\(_{(\text {Q}\,>\,\text {P})}\) are still present although less marked.
3.2 Nonlinear Problem
The second series of numerical experiments were undertaken using the twodimensional compressible Euler equations which can be written as follows
where \(\varvec{q} = (\rho , \rho u, \rho v, E)^\top \) is the vector of the conserved variables and \(\varvec{f}^{i}_{1} = \varvec{f}^{i}_{1}(\varvec{q})\) and \(\varvec{f}^{i}_{2} = \varvec{f}^{i}_{2} (\varvec{q})\) are the vectors of the inviscid fluxes,
In the above, \(\rho \) is the density, u and v are the velocity components in the x and ydirection respectively, p is the pressure and E is the total energy
for which we assumed the perfect gas law. Note that \(\gamma \) denotes the constant ratio of specific heats of the gas.
As test case we considered the isentropic vortex problem whose initial conditions on a twodimensional grid can be written as follows
where
with \(\beta = 5\), \(R = 1\) and \(\gamma = 1.4\). For both mesh configurations, we used an explicit 4thorder Runge–Kutta scheme for the timeintegration with a final time \(T = 2s\) and a timestep sufficiently small to consider the temporal error negligible. We employed four different polynomial orders to discretise the solution. Specifically, for the meshes in Fig. 1 we used \(P = 10, 11, 12\) and 13, while, for the meshes in Fig. 2, we applied \(P = 5, 6, 7\) and 8. The main parameters used are summarized in Table 3.
3.2.1 Mesh A
Figure 5 represents the L\(^{2}\) error associated to the density (\(\rho \)) vs the polynomial order obtained using GLL points for the various schemes tested where Fig. 5a refers to the regular mesh represented in Figs. 1a and 5b refers to the mesh in Fig. 1c. Table 6 in the “Appendix” quantifies up to sixteen digits the results obtained for both GLL and GL points for \(P=10\) and all the three grids in Fig. 1. Also in the case of a nonlinear problem the same equivalences presented before maintain their validity up to machine precision as shown in Table 6.
However, considerations on polynomial aliasing are different because in this case the aliasing sources arise both from the equations themselves, which are nonlinear, and from the geometry. Significant, in particular, is the gap between the pair FR\(_{\text {DG}}\), DG\(_{\text {SEM}}\) and the pair FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\), DG\(_{(\text {Q}\,>\,\text {P})}\).
3.2.2 Mesh B
Figure 6 represents the L\(^{2}\) error associated to the density (\(\rho \)) versus the polynomial order obtained using GLL points for the various schemes tested where Fig. 6a refers to the regular mesh represented in Figs. 2a and 6b refers to the mesh in Fig. 2c. Table 7 in the “Appendix” quantifies up to sixteen digits the results obtained for both GLL and GL points for \(P=5\) and all the three grids in Fig. 2. Identical considerations can be made for both connections and polynomial aliasing issues as in the previous subsection.
3.3 Comparison of Computational Time
In this subsection we present the comparison between the various schemes considered in terms of computational time. In particular, we show the results for the linear problem on the multielement mesh (mesh B) for both the regular case (A\(_{2}\) = 0.0) and for the deformed case (A\(_{2}\) = 0.2). Note also that we show the results for both GLL and GL points. The results on the single element mesh (mesh A) as well as the results for the nonlinear case are not presented since the conclusions we can draw are identical to the one we can obtain from the results presented.
Figure 7 shows the CPUtime required to perform a timestep for both GLL and GL point distributions and for four different schemes on the regular mesh (A\(_{2}\) = 0.0). We can note that the FR\(_{\text {HU}}\) scheme provides a similar computational time per timestep if compared to the DG\(_{\text {SEM}}\)LMM scheme and that the FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) scheme has a similar computational cost if compared to the DG\(_{(\text {Q}\,>\,\text {P})}\) scheme. Given that the DG and FR pair of schemes considered are mathematically identical one expects similar if not equal computational times per timestep. The differences observed are mainly due to the implementation of the two approaches and in particular to their different data structures. In fact, the FR approach has been implemented in the standard element space while the DG approach has been implemented in the local element space. We can also observe that the collocated schemes, FR\(_{\text {HU}}\) and DG\(_{\text {SEM}}\)LMM, provides more efficient algorithms, while using the noncollocated counterparts, FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\), gives a higher computational time per timestep. This is due to the lower number of operations required per timestep when adopting a collocation projection than using a higher quadrature. Also, it can be seen how the use of GL points (Fig. 7b) provides a higher computational time per timestep than the use of GLL points (Fig. 7a). When using GL points, in fact, it is necessary to interpolate the solution and the fluxes at the boundaries of the element. This additional step increases the operation count thus the overall computational costs of a given timestep.
Figure 8 shows the same results as Fig. 7, with the only difference that in this case the mesh considered is the deformed one (A\(_{2}\) = 0.2). We can see that the overall cost of a given timestep is higher than the regularmesh case. In this case in fact the operation count is larger due to the pointwise nature of the geometric factors. Also in this case it is possible to observe a higher computational costs per timestep for the case of GL points (Fig. 8b) if compared to GLL points (Fig. 8a) and the collocated schemes (FR\(_{\text {HU}}\) and DG\(_{\text {SEM}}\)LMM) perform better than the noncollocated ones (FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\)).
3.4 Summary
In this section we presented several numerical experiments for both a linear and a nonlinear problem on two mesh configurations. For each mesh configuration we applied three different deformation levels, the first was a regular mesh, which was used as a baseline, while the other two were meshes with incremental deformation levels. In particular we showed how the identities shown in Table 1 and proved in Sect. 2 are further assessed (up to machine precision) across all the tests performed. An additional result shown in this section is the equivalence of FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\) schemes which implies that the aliasing issues arising in FR\(_{\text {DG}}\) and DG\(_{\text {SEM}}\) are numerically the same and can be alleviated using a higher quadrature \(Q > P\), i.e. consistent integration of the nonlinearities arising in the problem (although the concept of integration could be seen as out of context for an FR scheme because there are no integrals present in the formulation of this approach). Note that the use of a better point distribution with a more powerful quadrature, such as the GL points, can also alleviate aliasing issues. However, when the nonlinearity cannot be fully described by the GL quadrature, then also in this case one could use additional quadrature points for consistently integrate the nonlinearity sources. In addition, we showed the computational costs associated to the FR and DG schemes for both the GLL and GL point distributions on the linear advection problem. Although no attempt was made to optimise the underlying algorithms of the two numerical approaches, it can be seen that both provide similar computational costs as expected. The differences observed can be imputed to the different data structures between the FR and the DG approach. Specifically, the first was implemented in the standard element space (\(\xi \), \(\eta \)), while the second on the local element space (x, y).
4 Conclusions
In this paper we established that the connections between various discontinuous Galerkin methods and highorder FR schemes are also valid on quadrilateral irregular/curved meshes. In addition, we found that the polynomial aliasing sources for the FR and DG schemes considered are identical and can be addressed using the same techniques. Specifically, we established that the FR and DG schemes taken into account are identical when a higherorder quadrature rule, usually adopted when applying overintegrationbased (also referred to as consistentintegration) dealiasing strategies, is employed.
The schemes considered for the DG approach are the DG\(_{\text {SEM}}\) with a lumped mass matrix (LMM) and a collocation projection of the solution and of the inner product, the DG\(_{\text {SEM}}\) with an exact mass matrix (EMM) and a collocation projection of the solution and of the inner product and the DG\(_{(\text {Q}\,>\,\text {P})}\) with exact mass matrix (EMM) and an additional quadrature point for representing the solution and performing the inner product (i.e. using a Galerkin projection of the solution and of the inner product). For what concerns the FR schemes we took into account the FR\(_{\text {HU}}\) scheme, the FR\(_{\text {DG}}\) scheme and FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) scheme which used an additional quadrature point to represent the solution (i.e. using a Galerkin projection of the solution).
We found that the connections between discontinuous Galerkin methods and highorder flux reconstruction schemes explored in [10] for regular grids hold true also for irregular/curvilinear meshes. In particular we mathematically proved the equivalences between FR\(_{\text {HU}}\) and DG\(_{\text {SEM}}\) with lumped mass matrix and the connections between FR\(_{\text {DG}}\) and DG\(_{\text {SEM}}\) with exact mass matrix. Both demonstrations were further assessed by numerical experiments on two different mesh configurations at different grid deformation levels and for both linear and nonlinear problems. In addition, we showed numerically how these connections are valid when applying a higher quadrature \(Q>P\) (i.e. using more quadrature points than a collocation projection: FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\) and DG\(_{(\text {Q}\,>\,\text {P})}\)) whose use can be crucial for stabilising problems with significant polynomial aliasing issues such as under or marginallyresolved problems (e.g. high Reynolds number simulations). This result indicates that the aliasing sources for FR\(_{\text {DG}}\) and DG\(_{\text {SEM}}\) are identical and can be addressed using identical strategies.
The latter result is particularly significant because it shows how the machinery for the DG method for tackling aliasing issues and improving the numerical stability of this class of schemes can be directly deployed to the FR schemes.
Finally, we showed that, in our current codebase, the computational costs are similar when considering a pair of identical FR and DG schemes. The differences observed are mainly imputable to the different implementation—related to the data structures—of the two approaches.
Notes
In [3, 4] the DG\(_{\text {SEM}}\) method implies a collocation quadrature rule for the inner product of all the terms of the discretisation and not only of the advection term. This leads to a diagonal mass matrix which, in the case of Gauss–Lobatto–Legendre points, is not an exact mass matrix but a lumped one.
The terms ‘lumped’ and ‘exact’ refer to the mass matrix when solving a linear problem.
In this introduction P indicates the Lagrange interpolant. This allows to maintain a compact notation for the DG(Q \(>\) P) and FRDG(Q \(>\) P) schemes. Note however that in the rest of the paper P indicates the order of the Lagrange polynomials.
In the case of regular mesh the results for the pairs FR\(_{\text {DG}}\), DG\(_{\text {SEM}}\) with exact mass matrix and FR\(_{\text {DG}(\text {Q}\,>\,\text {P})}\), DG\(_{(\text {Q}\,>\,\text {P})}\) are not equivalent because we used a different projection of the initial conditions. Using the same projection of the initial conditions provides identical results.
References
Reed, W.H., Hill, T.R.: Triangular Mesh Methods for the Neutron Transport Equation. Technical Report LAUR73479, Los Alamos National Laboratory, Los Alamos, NM (1973)
Hesthaven, J.S., Warburton, T.: Nodal Discontinuous Galerkin MethodsAlgorithms, Analysis, and Applications. Springer, Berlin (2008)
Kopriva, D.A., Woodruff, S.L., Hussaini, M.Y.: Discontinuous Spectral Element Approximation of Maxwell’s Equations. Discontinuous Galerkin Methods. Springer, Berlin (2000)
Gassner, G., Kopriva, D.A.: On the quadrature and weak form choices in collocation type discontinuous Galerkin spectral element methods. J. Sci. Comput. 44(2), 136–155 (2010)
Kopriva, D.A., Kolias, J.H.: A conservative staggeredgrid Chebyshev multidomain method for compressible flows. J. Comput. Phys. 125, 475–488 (1996)
Liu, Y., Vinokur, M., Wang, Z.J.: Spectral difference method for unstructured grids I: basic formulation. J. Comput. Phys. 216, 780–801 (2006)
Huynh, H.T.: A flux reconstruction approach to highorder schemes including discontinuous Galerkin methods. In: 18th AIAA CFD Conference”, 25–28 June 2007, Miami, FL (2007)
Vincent, P.E., Castonguay, P., Jameson, A.: A new class of highorder energy stable flux reconstruction. J. Sci. Comput. 47, 50–72 (2011)
Allaneau, 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, 3628–3636 (2011)
De Grazia, D., Mengaldo, G., Moxey, D., Vincent, P.E., Sherwin, S.J.: Connections between the discontinuous Galerkin method and highorder flux reconstruction schemes. Int. J. Numer. Meth. Fluids 75, 860–877 (2014)
Kirby, R.M., Karniadakis, G.E.: Dealiasing on nonuniform grids: algorithms and applications. J. Comput. Phys. 191, 249–263 (2003)
Mengaldo, G., De Grazia, D., Moxey, D., Vincent, P.E., Sherwin, S.J.: Dealiasing techniques for highorder spectral element methods on regular and irregular grids. J. Comput. Phys. 299, 56–81 (2015)
Karniadakis, G.E., Sherwin, S.J.: Spectral/hp Element Methods for Computational Fluid Dynamics. Oxford University Press, Oxford (2005)
Persson, P.O.: A sparse and highorder accurate linebased discontinuous Galerkin method for unstructured meshes. J. Comput. Phys. 233, 414–429 (2013)
Yu, M., Wang, Z.J.: On the accuracy and efficiency of several discontinuous highorder formulations. In: 51st AIAA Aerospace Sciences Meeting, Dallas/Ft. Worth Region, Texas, 07–10 January 2013
Acknowledgments
This work was supported by the Laminar Flow Control Centre funded by Airbus/EADS and EPSRC under grant EP/I037946. PV would like to acknowledge the Engineering and Physical Sciences Research Council for their support via an Early Career Fellowship (EP/K027379/1). SJS additionally acknowledges Royal Academy of Engineering support under their research chair scheme.
Author information
Authors and Affiliations
Corresponding author
Appendix: Tabulated Numerical Results
Appendix: Tabulated Numerical Results
In this appendix we show some tabulated values of the numerical experiments carried out for both the linear and the nonlinear problem on all the grids and for both the point distributions considered.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Mengaldo, G., De Grazia, D., Vincent, P.E. et al. On the Connections Between Discontinuous Galerkin and Flux Reconstruction Schemes: Extension to Curvilinear Meshes. J Sci Comput 67, 1272–1292 (2016). https://doi.org/10.1007/s109150150119z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s109150150119z
Keywords
 Spectral/hp methods
 Discontinuous Galerkin
 Flux reconstruction
 Aliasing
 Irregular grids