An hp‐adaptive discontinuous Galerkin method for shallow water flows

An adaptive spectral/hp discontinuous Galerkin method for the two‐dimensional shallow water equations is presented. The model uses an orthogonal modal basis of arbitrary polynomial order p defined on unstructured, possibly non‐conforming, triangular elements for the spatial discretization. Based on a simple error indicator constructed by the solutions of approximation order p and p?1, we allow both for the mesh size, h, and polynomial approximation order to dynamically change during the simulation. For the h‐type refinement, the parent element is subdivided into four similar sibling elements. The time‐stepping is performed using a third‐order Runge–Kutta scheme. The performance of the hp‐adaptivity is illustrated for several test cases. It is found that for the case of smooth flows, p‐adaptivity is more efficient than h‐adaptivity with respect to degrees of freedom and computational time. Copyright © 2010 John Wiley & Sons, Ltd.     

An adaptive discretization of shallow‐water equations based on discontinuous Galerkin methods

In this paper, we present a discontinuous Galerkin formulation of the shallow‐water equations. An orthogonal basis is used for the spatial discretization and an explicit Runge–Kutta scheme is used for time discretization. Some results of second‐order anisotropic adaptive calculations are presented for dam breaking problems. The adaptive procedure uses an error indicator that concentrates the computational effort near discontinuities like hydraulic jumps. Copyright © 2006 John Wiley & Sons, Ltd.     

A triangular spectral/hp discontinuous Galerkin method for modelling 2D shallow water equations

We present a spectral/hp element discontinuous Galerkin model for simulating shallow water flows on unstructured triangular meshes. The model uses an orthogonal modal expansion basis of arbitrary order for the spatial discretization and a third‐order Runge–Kutta scheme to advance in time. The local elements are coupled together by numerical fluxes, evaluated using the HLLC Riemann solver. We apply the model to test cases involving smooth flows and demonstrate the exponentially fast convergence with regard to polynomial order. We also illustrate that even for results of ‘engineering accuracy’ the computational efficiency increases with increasing order of the model and time of integration. The model is found to be robust in the presence of shocks where Gibbs oscillations can be suppressed by slope limiting. Copyright 2004 John Wiley & Sons, Ltd.     

An eigenvector‐based linear reconstruction approach for time stepping in discontinuous Galerkin scheme used to solve shallow water equations

Discontinuous Galerkin (DG) methods have shown promising results for solving the two‐dimensional shallow water equations. In this paper, the classical Runge–Kutta (RK) time discretisation is replaced by the eigenvector‐based reconstruction (EVR) that allows the second‐order time accuracy to be achieved within a single time‐stepping procedure. Moreover, the EVRDG approach yields stable solutions near drying and wetting fronts, whereas the classical RKDG approach yields instabilities. The proposed EVRDG technique is compared with the original RKDG approach on various test cases with analytical solutions. The EVRDG solutions are shown to be as accurate as those obtained with the RKDG scheme. Besides, the EVRDG scheme is 1.6 times faster than the RKDG method. Simulating dambreaks involving dry beds confirms that EVRDG scheme gives correct solutions, whereas the RKDG method yields instabilities. Copyright © 2012 John Wiley & Sons, Ltd.     

An improvement of classical slope limiters for high‐order discontinuous Galerkin method

In this paper, we describe some existing slope limiters (Cockburn and Shu's slope limiter and Hoteit's slope limiter) for the two‐dimensional Runge–Kutta discontinuous Galerkin (RKDG) method on arbitrary unstructured triangular grids. We describe the strategies for detecting discontinuities and for limiting spurious oscillations near such discontinuities, when solving hyperbolic systems of conservation laws by high‐order discontinuous Galerkin methods. The disadvantage of these slope limiters is that they depend on a positive constant, which is, for specific hydraulic problems, difficult to estimate in order to eliminate oscillations near discontinuities without decreasing the high‐order accuracy of the scheme in the smooth regions. We introduce the idea of a simple modification of Cockburn and Shu's slope limiter to avoid the use of this constant number. This modification consists in: slopes are limited so that the solution at the integration points is in the range spanned by the neighboring solution averages. Numerical results are presented for a nonlinear system: the shallow water equations. Four hydraulic problems of discontinuous solutions of two‐dimensional shallow water are presented. The idealized dam break problem, the oblique hydraulic jump problem, flow in a channel with concave bed and the dam break problem in a converging–diverging channel are solved by using the different slope limiters. Numerical comparisons on unstructured meshes show a superior accuracy with the modified slope limiter. Moreover, it does not require the choice of any constant number for the limiter condition. Copyright © 2008 John Wiley & Sons, Ltd.     

A high‐order discontinuous Galerkin method for all‐speed flows

In this article, we present a discontinuous Galerkin (DG) method designed to improve the accuracy and efficiency of steady solutions of the compressible fully coupled Reynolds‐averaged Navier–Stokes and k ? ω turbulence model equations for solving all‐speed flows. The system of equations is iterated to steady state by means of an implicit scheme. The DG solution is extended to the incompressible limit by implementing a low Mach number preconditioning technique. A full preconditioning approach is adopted, which modifies both the unsteady terms of the governing equations and the dissipative term of the numerical flux function by means of a new preconditioner, on the basis of a modified version of Turkel's preconditioning matrix. At sonic speed the preconditioner reduces to the identity matrix thus recovering the non‐preconditioned DG discretization. An artificial viscosity term is added to the DG discretized equations to stabilize the solution in the presence of shocks when piecewise approximations of order of accuracy higher than 1 are used. Moreover, several rescaling techniques are implemented in order to overcome ill‐conditioning problems that, in addition to the low Mach number stiffness, can limit the performance of the flow solver. These approaches, through a proper manipulation of the governing equations, reduce unbalances between residuals as a result of the dependence on the size of elements in the computational mesh and because of the inherent differences between turbulent and mean‐flow variables, influencing both the evolution of the Courant Friedrichs Lewy (CFL) number and the inexact solution of the linear systems. The performance of the method is demonstrated by solving three turbulent aerodynamic test cases: the flat plate, the L1T2 high‐lift configuration and the RAE2822 airfoil (Case 9). The computations are performed at different Mach numbers using various degrees of polynomial approximations to analyze the influence of the proposed numerical strategies on the accuracy, efficiency and robustness of a high‐order DG solver at different flow regimes. Copyright © 2014 John Wiley & Sons, Ltd.     

One‐dimensional shock‐capturing for high‐order discontinuous Galerkin methods

Discontinuous Galerkin methods have emerged in recent years as an alternative for nonlinear conservation equations. In particular, their inherent structure (a numerical flux based on a suitable approximate Riemann solver introduces some stabilization) suggests that they are specially adapted to capture shocks. However, numerical fluxes are not sufficient to stabilize the solution in the presence of shocks. Thus, slope limiter methods, which are extensions of finite volume methods, have been proposed. These techniques require, in practice, mesh adaption to localize the shock structure. This is is more obvious for large elements typical of high‐order approximations. Here, a new approach based on the introduction of artificial diffusion into the original equations is presented. The order is not systematically decreased to one in the presence of the shock, large high‐order elements can be used, and several linear and nonlinear tests demonstrate the efficiency of the proposed methodology. Copyright © 2012 John Wiley & Sons, Ltd.     

A simple shock‐capturing technique for high‐order discontinuous Galerkin methods

This article presents a novel shock‐capturing technique for the discontinuous Galerkin (DG) method. The technique is designed for compressible flow problems, which are usually characterized by the presence of strong shocks and discontinuities. The inherent structure of standard DG methods seems to suggest that they are especially adapted to capture shocks because of the numerical fluxes based on suitable approximate Riemann solvers, which, in practice, introduces some stabilization. However, the usual numerical fluxes are not sufficient to stabilize the solution in the presence of shocks for large high‐order elements. Here, a new basis of shape functions is introduced. It has the ability to change locally between a continuous or discontinuous interpolation depending on the smoothness of the approximated function. In the presence of shocks, the new discontinuities inside an element introduce the required stabilization because of numerical fluxes. Large high‐order elements can therefore be used and shocks captured within a single element, avoiding adaptive mesh refinement and preserving the locality and compactness of the DG scheme. Several numerical examples for transonic and supersonic flows are studied to demonstrate the applicability of the proposed approach. Copyright © 2011 John Wiley & Sons, Ltd.     

A high‐order discontinuous Galerkin solver for low Mach number flows

In this work, we present a high‐order discontinuous Galerkin method (DGM) for simulating variable density flows at low Mach numbers. The corresponding low Mach number equations are an approximation of the compressible Navier–Stokes equations in the limit of zero Mach number. To the best of the authors'y knowledge, it is the first time that the DGM is applied to the low Mach number equations. The mixed‐order formulation is applied for spatial discretization. For steady cases, we apply the semi‐implicit method for pressure‐linked equation (SIMPLE) algorithm to solve the non‐linear system in a segregated manner. For unsteady cases, the solver is implicit in time using backward differentiation formulae, and the SIMPLE algorithm is applied to solve the non‐linear system in each time step. Numerical results for the following three test cases are shown: Couette flow with a vertical temperature gradient, natural convection in a square cavity, and unsteady natural convection in a tall cavity. Considering a fixed number of degrees of freedom, the results demonstrate the benefits of using higher approximation orders. Copyright © 2015 John Wiley & Sons, Ltd.     

Stability/dispersion analysis of the discontinuous Galerkin linearized shallow‐water system

The frequency or dispersion relation for the discontinuous Galerkin mixed formulation of the 1‐D linearized shallow‐water equations is analysed, using several basic DG mixed schemes. The dispersion properties are compared analytically and graphically with those of the mixed continuous Galerkin formulation for piecewise‐linear bases on co‐located grids. Unlike the Galerkin case, the DG scheme does not exhibit spurious stationary pressure modes. However, spurious propagating modes have been identified in all the present discontinuous Galerkin formulations. Numerical solutions of a test problem to simulate fast gravity modes illustrate the theoretical results and confirm the presence of spurious propagating modes in the DG schemes. Copyright © 2005 John Wiley & Sons, Ltd.     

High‐order accurate p‐multigrid discontinuous Galerkin solution of the Euler equations

Discontinuous Galerkin (DG) methods have proven to be perfectly suited for the construction of very high‐order accurate numerical schemes on arbitrary unstructured and possibly nonconforming grids for a wide variety of applications, but are rather demanding in terms of computational resources. In order to improve the computational efficiency of this class of methods a p‐multigrid solution strategy has been developed, which is based on a semi‐implicit Runge–Kutta smoother for high‐order polynomial approximations and the implicit Backward Euler smoother for piecewise constant approximations. The effectiveness of the proposed approach is demonstrated by comparison with p‐multigrid schemes employing purely explicit smoothing operators for several 2D inviscid test cases. Copyright © 2008 John Wiley & Sons, Ltd.     

High‐order continuous and discontinuous Galerkin methods for wave problems

Three Galerkin methods—continuous Galerkin, Compact Discontinuous Galerkin, and hybridizable discontinuous Galerkin—are compared in terms of performance and computational efficiency in 2‐D scattering problems for low and high‐order polynomial approximations. The total number of DOFs and the total runtime are used for this correlation as well as the corresponding precision. The comparison is carried out through various numerical examples. The superior performance of high‐order elements is shown. At the same time, similar capabilities are shown for continuous Galerkin and hybridizable discontinuous Galerkin, when high‐order elements are adopted, both of them clearly outperforming compact discontinuous Galerkin. Copyright © 2013 John Wiley & Sons, Ltd.     

High‐order semi‐implicit time‐integrators for a triangular discontinuous Galerkin oceanic shallow water model

We extend the explicit in time high‐order triangular discontinuous Galerkin (DG) method to semi‐implicit (SI) and then apply the algorithm to the two‐dimensional oceanic shallow water equations; we implement high‐order SI time‐integrators using the backward difference formulas from orders one to six. The reason for changing the time‐integration method from explicit to SI is that explicit methods require a very small time step in order to maintain stability, especially for high‐order DG methods. Changing the time‐integration method to SI allows one to circumvent the stability criterion due to the gravity waves, which for most shallow water applications are the fastest waves in the system (the exception being supercritical flow where the Froude number is greater than one). The challenge of constructing a SI method for a DG model is that the DG machinery requires not only the standard finite element‐type area integrals, but also the finite volume‐type boundary integrals as well. These boundary integrals pose the biggest challenge in a SI discretization because they require the construction of a Riemann solver that is the true linear representation of the nonlinear Riemann problem; if this condition is not satisfied then the resulting numerical method will not be consistent with the continuous equations. In this paper we couple the SI time‐integrators with the DG method while maintaining most of the usual attributes associated with DG methods such as: high‐order accuracy (in both space and time), parallel efficiency, excellent stability, and conservation. The only property lost is that of a compact communication stencil typical of time‐explicit DG methods; implicit methods will always require a much larger communication stencil. We apply the new high‐order SI DG method to the shallow water equations and show results for many standard test cases of oceanic interest such as: standing, Kelvin and Rossby soliton waves, and the Stommel problem. The results show that the new high‐order SI DG model, that has already been shown to yield exponentially convergent solutions in space for smooth problems, results in a more efficient model than its explicit counterpart. Furthermore, for those problems where the spatial resolution is sufficiently high compared with the length scales of the flow, the capacity to use high‐order (HO) time‐integrators is a necessary complement to the employment of HO space discretizations, since the total numerical error would be otherwise dominated by the time discretization error. In fact, in the limit of increasing spatial resolution, it makes little sense to use HO spatial discretizations coupled with low‐order time discretizations. Published in 2009 by John Wiley & Sons, Ltd.     

Efficiency of high‐performance discontinuous Galerkin spectral element methods for under‐resolved turbulent incompressible flows

The present paper addresses the numerical solution of turbulent flows with high‐order discontinuous Galerkin methods for discretizing the incompressible Navier‐Stokes equations. The efficiency of high‐order methods when applied to under‐resolved problems is an open issue in the literature. This topic is carefully investigated in the present work by the example of the three‐dimensional Taylor‐Green vortex problem. Our implementation is based on a generic high‐performance framework for matrix‐free evaluation of finite element operators with one of the best realizations currently known. We present a methodology to systematically analyze the efficiency of the incompressible Navier‐Stokes solver for high polynomial degrees. Due to the absence of optimal rates of convergence in the under‐resolved regime, our results reveal that demonstrating improved efficiency of high‐order methods is a challenging task and that optimal computational complexity of solvers and preconditioners as well as matrix‐free implementations are necessary ingredients in achieving the goal of better solution quality at the same computational costs already for a geometrically simple problem such as the Taylor‐Green vortex. Although the analysis is performed for a Cartesian geometry, our approach is generic and can be applied to arbitrary geometries. We present excellent performance numbers on modern cache‐based computer architectures achieving a throughput for operator evaluation of 3·10⁸ up to 1·10⁹ DoFs/s (degrees of freedom per second) on one Intel Haswell node with 28 cores. Compared to performance results published within the last five years for high‐order discontinuous Galerkin discretizations of the compressible Navier‐Stokes equations, our approach reduces computational costs by more than one order of magnitude for the same setup.     

A high‐order accurate discontinuous Galerkin finite element method for laminar low Mach number flows

In this paper we present a discontinuous Galerkin (DG) method designed to improve the accuracy and efficiency of laminar flow simulations at low Mach numbers using an implicit scheme. The algorithm is based on the flux preconditioning approach, which modifies only the dissipative terms of the numerical flux. This formulation is quite simple to implement in existing implicit DG codes, it overcomes the time‐stepping restrictions of explicit multistage algorithms, is consistent in time and thus applicable to unsteady flows. The performance of the method is demonstrated by solving the flow around a NACA0012 airfoil and on a flat plate, at different low Mach numbers using various degrees of polynomial approximations. Computations with and without flux preconditioning are performed on different grid topologies to analyze the influence of the spatial discretization on the accuracy of the DG solutions at low Mach numbers. The time accurate solution of unsteady flow is also demonstrated by solving the vortex shedding behind a circular cylinder at the Reynolds number of 100. Copyright © 2012 John Wiley & Sons, Ltd.     

A high‐order discontinuous Galerkin method for extension problems

We present a novel technique for solving extension problems such as the extension velocity, by reformulating the problem into an elliptic differential equation. We introduce a novel discretization using an upwind flux without any additional stabilization. This leads to a triangular matrix structure, which can be solved using a marching algorithm and high‐order accuracy, even in the presence of singularities.     

Multirate time stepping for accelerating explicit discontinuous Galerkin computations with application to geophysical flows

This paper presents multirate explicit time‐stepping schemes for solving partial differential equations with discontinuous Galerkin elements in the framework of Large‐scale marine flows. It addresses the variability of the local stable time steps by gathering the mesh elements in appropriate groups. The real challenge is to develop methods exhibiting mass conservation and consistency. Two multirate approaches, based on standard explicit Runge–Kutta methods, are analyzed. They are well suited and optimized for the discontinuous Galerkin framework. The significant speedups observed for the hydrodynamic application of the Great Barrier Reef confirm the theoretical expectations. Copyright © 2012 John Wiley & Sons, Ltd.     

A numerical investigation of a spectral‐type nodal collocation discontinuous Galerkin approximation of the Euler and Navier–Stokes equations

In this paper, we focus on the applicability of spectral‐type collocation discontinuous Galerkin methods to the steady state numerical solution of the inviscid and viscous Navier–Stokes equations on meshes consisting of curved quadrilateral elements. The solution is approximated with piecewise Lagrange polynomials based on both Legendre–Gauss and Legendre–Gauss–Lobatto interpolation nodes. For the sake of computational efficiency, the interpolation nodes can be used also as quadrature points. In this case, however, the effect of the nonlinearities in the equations and/or curved elements leads to aliasing and/or commutation errors that may result in inaccurate or unstable computations. By a thorough numerical testing on a set of well known test cases available in the literature, it is here shown that the two sets of nodes behave very differently, with a clear advantage of the Legendre–Gauss nodes, which always displayed an accurate and robust behaviour in all the test cases considered.Copyright © 2012 John Wiley & Sons, Ltd.     

Practical aspects of p‐multigrid discontinuous Galerkin solver for steady and unsteady RANS simulations

Efficient and robust p‐multigrid solvers are presented for solving the system arising from high‐order discontinuous Galerkin discretizations of the compressible Reynolds‐Averaged Navier–Stokes (RANS) equations. Two types of multigrid methods and a multigrid preconditioned Newton–Krylov method are investigated, and both steady and unsteady algorithms are considered in this paper. For steady algorithms, a new strategy is introduced to determine the CFL number, which has been proved to be critical in achieving the effective and stable convergence for p‐multigrid methods. We also suggest a modified smoothing technique to further improve the efficiency of the algorithms. For unsteady algorithms, special attention has been paid to the cycling strategy and the full multigrid technique, and we point out a significant difference on the parameter selection for unsteady computations. The capabilities of the resulted solvers have been examined by performing steady and unsteady RANS simulations. Comparative assessment in terms of efficiency, robustness, and memory consumption are carried out for all solvers. Copyright © 2015 John Wiley & Sons, Ltd.