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.     

Spectral p‐multigrid discontinuous Galerkin solution of the Navier–Stokes equations

Discontinuous Galerkin (DG) methods are very well suited for the construction of very high‐order approximations of the Euler and Navier–Stokes equations on unstructured and possibly nonconforming grids, but are rather demanding in terms of computational resources. In order to improve the computational efficiency of this class of methods, a high‐order spectral element DG approximation of the Navier–Stokes equations coupled with a p‐multigrid solution strategy based on a semi‐implicit Runge–Kutta smoother is considered here. The effectiveness of the proposed approach in the solution of compressible shockless flow problems is demonstrated on 2D inviscid and viscous test cases by comparison with both a p‐multigrid scheme with non‐spectral elements and a spectral element DG approach with an implicit time integration scheme. Copyright © 2010 John Wiley & Sons, Ltd.     

Investigation and application of point implicit Runge–Kutta methods to inviscid flow problems

We derive and investigate point implicit Runge–Kutta methods to significantly improve the convergence rate to approximate steady‐state solutions of inviscid flows. It turns out that the point implicit Runge–Kutta can be interpreted as a preconditioned explicit Runge–Kutta method, where the preconditioner arises naturally as local derivative of the residual function. Moreover, many preconditioners suggested in the literature so far are identified as special case of our general ansatz. Conditions will be formulated such that explicit Runge–Kutta methods with local time stepping are equivalent to point implicit methods. In numerical examples, we will demonstrate the improved convergence rates. Copyright © 2011 John Wiley & Sons, Ltd.     

Third‐order‐accurate semi‐implicit Runge–Kutta scheme for incompressible Navier–Stokes equations

A semi‐implicit three‐step Runge–Kutta scheme for the unsteady incompressible Navier–Stokes equations with third‐order accuracy in time is presented. The higher order of accuracy as compared to the existing semi‐implicit Runge–Kutta schemes is achieved due to one additional inversion of the implicit operator I‐τγL, which requires inversion of tridiagonal matrices when using approximate factorization method. No additional solution of the pressure‐Poisson equation or evaluation of Navier–Stokes operator is needed. The scheme is supplied with a local error estimation and time‐step control algorithm. The temporal third‐order accuracy of the scheme is proved analytically and ascertained by analysing both local and global errors in a numerical example. Copyright © 2005 John Wiley & Sons, Ltd.     

A multigrid adaptive mesh refinement strategy for 3D aerodynamic design

Presently, improving the accuracy and reducing computational costs are still two major CFD objectives often considered incompatible. This paper proposes to solve this dilemma by developing an adaptive mesh refinement method in order to integrate the 3D Euler and Navier–Stokes equations on structured meshes, where a local multigrid method is used to accelerate convergence for steady compressible flows. The time integration method is a LU‐SGS method (AIAA J 1988; 26: 1025–1026) associated with a spatial Jameson‐type scheme (Numerical solutions of the Euler equations by finite volume methods using Runge–Kutta time‐stepping schemes. AIAA Paper, 81‐1259, 1981). Computations of turbulent flows are handled by the standard k–ω model of Wilcox (AIAA J 1994; 32: 247–255). A coarse grid correction, based on composite residuals, has been devised in order to enforce the coupling between the different grid levels and to accelerate the convergence. The efficiency of the method is evaluated on standard 2D and 3D aerodynamic configurations. Copyright © 2004 John Wiley & Sons, Ltd.     

A third‐order implicit discontinuous Galerkin method based on a Hermite WENO reconstruction for time‐accurate solution of the compressible Navier–Stokes equations

A space and time third‐order discontinuous Galerkin method based on a Hermite weighted essentially non‐oscillatory reconstruction is presented for the unsteady compressible Euler and Navier–Stokes equations. At each time step, a lower‐upper symmetric Gauss–Seidel preconditioned generalized minimal residual solver is used to solve the systems of linear equations arising from an explicit first stage, single diagonal coefficient, diagonally implicit Runge–Kutta time integration scheme. The performance of the developed method is assessed through a variety of unsteady flow problems. Numerical results indicate that this method is able to deliver the designed third‐order accuracy of convergence in both space and time, while requiring remarkably less storage than the standard third‐order discontinous Galerkin methods, and less computing time than the lower‐order discontinous Galerkin methods to achieve the same level of temporal accuracy for computing unsteady flow problems. Copyright © 2015 John Wiley & Sons, Ltd.     

On the efficiency of semi‐implicit and semi‐Lagrangian spectral methods for the calculation of incompressible flows

Classical semi‐implicit backward Euler/Adams–Bashforth time discretizations of the Navier–Stokes equations induce, for high‐Reynolds number flows, severe restrictions on the time step. Such restrictions can be relaxed by using semi‐Lagrangian schemes essentially based on splitting the full problem into an explicit transport step and an implicit diffusion step. In comparison with the standard characteristics method, the semi‐Lagrangian method has the advantage of being much less CPU time consuming where spectral methods are concerned. This paper is devoted to the comparison of the ‘semi‐implicit’ and ‘semi‐Lagrangian’ approaches, in terms of stability, accuracy and computational efficiency. Numerical results on the advection equation, Burger's equation and finally two‐ and three‐dimensional Navier–Stokes equations, using spectral elements or a collocation method, are provided. Copyright © 2001 John Wiley & Sons, Ltd.     

High‐order implicit time integration for unsteady incompressible flows

The spatial discretization of unsteady incompressible Navier–Stokes equations is stated as a system of differential algebraic equations, corresponding to the conservation of momentum equation plus the constraint due to the incompressibility condition. Asymptotic stability of Runge–Kutta and Rosenbrock methods applied to the solution of the resulting index‐2 differential algebraic equations system is analyzed. A critical comparison of Rosenbrock, semi‐implicit, and fully implicit Runge–Kutta methods is performed in terms of order of convergence and stability. Numerical examples, considering a discontinuous Galerkin formulation with piecewise solenoidal approximation, demonstrate the applicability of the approaches and compare their performance with classical methods for incompressible flows. Copyright © 2011 John Wiley & Sons, Ltd.     

An efficient discontinuous Galerkin method for aeroacoustic propagation

An efficient discontinuous Galerkin formulation is applied to the solution of the linearized Euler equations and the acoustic perturbation equations for the simulation of aeroacoustic propagation in two‐dimensional and axisymmetric problems, with triangular and quadrilateral elements. To improve computational efficiency, a new strategy of variable interpolation order is proposed in addition to a quadrature‐free approach and parallel implementation. Moreover, an accurate wall boundary condition is formulated on the basis of the solution of the Riemann problem for a reflective wall. Time discretization is based on a low dissipation formulation of a fourth‐order, low storage Runge–Kutta scheme. Along the far‐field boundaries a perfectly matched layer boundary condition is used. For the far‐field computations, the integral formulation of Ffowcs Williams and Hawkings is coupled with the near‐field solver. The efficiency and accuracy of the proposed variable order formulation is assessed for realistic geometries, namely sound propagation around a high‐lift airfoil and the Munt problem. Copyright © 2011 John Wiley & Sons, Ltd.     

Application of a line implicit method to fully coupled system of equations for turbulent flow problems

For unstructured finite volume methods, we present a line implicit Runge–Kutta method applied as smoother in an agglomerated multigrid algorithm to significantly improve the reliability and convergence rate to approximate steady-state solutions of the Reynolds-averaged Navier–Stokes equations. To describe turbulence, we consider a one-equation Spalart–Allmaras turbulence model. The line implicit Runge–Kutta method extends a basic explicit Runge–Kutta method by a preconditioner given by an approximate derivative of the residual function. The approximate derivative is only constructed along predetermined lines which resolve anisotropies in the given grid. Therefore, the method is a canonical generalisation of point implicit methods. Numerical examples demonstrate the improvements of the line implicit Runge–Kutta when compared with explicit Runge–Kutta methods accelerated with local time stepping.     

On the practical importance of the SSP property for Runge–Kutta time integrators for some common Godunov‐type schemes

We investigate through analysis and computational experiment explicit second and third‐order strong‐stability preserving (SSP) Runge–Kutta time discretization methods in order to gain perspective on the practical necessity of the SSP property. We consider general theoretical SSP limits for these schemes and present a new optimal third‐order low‐storage SSP method that is SSP at a CFL number of 0.838. We compare results of practical preservation of the TVD property using SSP and non‐SSP time integrators to integrate a class of semi‐discrete Godunov‐type spatial discretizations. Our examples involve numerical solutions to Burgers' equation and the Euler equations. We observe that ‘well‐designed’ non‐SSP and non‐optimal SSP schemes with SSP coefficients less than one provide comparable stability when used with time steps below the standard CFL limit. Results using a third‐order non‐TVD CWENO scheme are also presented. We verify that the documented SSP methods with the number of stages greater than the order provide a useful enhanced stability region. We show by analysis and by numerical experiment that the non‐oscillatory third‐order reconstructions used in (Liu and Tadmor Numer. Math. 1998; 79 :397–425, Kurganov and Petrova Numer. Math. 2001; 88 :683–729) are in general only second‐ and first‐order accurate, respectively. Copyright © 2005 John Wiley & Sons, Ltd.     

Numerical solutions of systems with (p,δ)‐structure using local discontinuous Galerkin finite element methods

In this paper, we present LDG methods for systems with (p,δ)‐structure. The unknown gradient and the nonlinear diffusivity function are introduced as auxiliary variables and the original (p,δ) system is decomposed into a first‐order system. Every equation of the produced first‐order system is discretized in the discontinuous Galerkin framework, where two different nonlinear viscous numerical fluxes are implemented. An a priori bound for a simplified problem is derived. The ODE system resulting from the LDG discretization is solved by diagonal implicit Runge–Kutta methods. The nonlinear system of algebraic equations with unknowns the intermediate solutions of the Runge–Kutta cycle is solved using Newton and Picard iterative methodology. The performance of the two nonlinear solvers is compared with simple test problems. Numerical tests concerning problems with exact solutions are performed in order to validate the theoretical spatial accuracy of the proposed method. Further, more realistic numerical examples are solved in domains with non‐smooth boundary to test the efficiency of the method. Copyright © 2014 John Wiley & Sons, Ltd.     

Acceleration on stretched meshes with line-implicit LU-SGS in parallel implementation

The implicit lower–upper symmetric Gauss–Seidel (LU-SGS) solver is combined with the line-implicit technique to improve convergence on the very anisotropic grids necessary for resolving the boundary layers. The computational fluid dynamics code used is Edge, a Navier–Stokes flow solver for unstructured grids based on a dual grid and edge-based formulation. Multigrid acceleration is applied with the intention to accelerate the convergence to steady state. LU-SGS works in parallel and gives better linear scaling with respect to the number of processors, than the explicit scheme. The ordering techniques investigated have shown that node numbering does influence the convergence and that the orderings from Delaunay and advancing front generation were among the best tested. 2D Reynolds-averaged Navier–Stokes computations have clearly shown the strong efficiency of our novel approach line-implicit LU-SGS which is four times faster than implicit LU-SGS and line-implicit Runge–Kutta. Implicit LU-SGS for Euler and line-implicit LU-SGS for Reynolds-averaged Navier–Stokes are at least twice faster than explicit and line-implicit Runge–Kutta, respectively, for 2D and 3D cases. For 3D Reynolds-averaged Navier–Stokes, multigrid did not accelerate the convergence and therefore may not be needed.     

Fifth‐order Hermitian schemes for computational linear aeroacoustics

We develop a class of fifth‐order methods to solve linear acoustics and/or aeroacoustics. Based on local Hermite polynomials, we investigate three competing strategies for solving hyperbolic linear problems with a fifth‐order accuracy. A one‐dimensional (1D) analysis in the Fourier series makes it possible to classify these possibilities. Then, numerical computations based on the 1D scalar advection equation support two possibilities in order to update the discrete variable and its first and second derivatives: the first one uses a procedure similar to that of Cauchy–Kovaleskaya (the ‘Δ‐P5 scheme’); the second one relies on a semi‐discrete form and evolves in time the discrete unknowns by using a five‐stage Runge–Kutta method (the ‘RGK‐P5 scheme’). Although the RGK‐P5 scheme shares the same local spatial interpolator with the Δ‐P5 scheme, it is algebraically simpler. However, it is shown numerically that its loss of compactness reduces its domain of stability. Both schemes are then extended to bi‐dimensional acoustics and aeroacoustics. Following the methodology validated in (J. Comput. Phys. 2005; 210 :133–170; J. Comput. Phys. 2006; 217 :530–562), we build an algorithm in three stages in order to optimize the procedure of discretization. In the ‘reconstruction stage’, we define a fifth‐order local spatial interpolator based on an upwind stencil. In the ‘decomposition stage’, we decompose the time derivatives into simple wave contributions. In the ‘evolution stage’, we use these fluctuations to update either by a Cauchy–Kovaleskaya procedure or by a five‐stage Runge–Kutta algorithm, the discrete variable and its derivatives. In this way, depending on the configuration of the ‘evolution stage’, two fifth‐order upwind Hermitian schemes are constructed. The effectiveness and the exactitude of both schemes are checked by their applications to several 2D problems in acoustics and aeroacoustics. In this aim, we compare the computational cost and the computation memory requirement for each solution. The RGK‐P5 appears as the best compromise between simplicity and accuracy, while the Δ‐P5 scheme is more accurate and less CPU time consuming, despite a greater algebraic complexity. Copyright © 2007 John Wiley & Sons, Ltd.     

Complete discretization scheme for milling stability prediction

This study presents a Complete Discretization Scheme (CDS) for milling stability prediction. When compared with the Semi-Discretization Method (SDM) and Full-Discretization Method (FDM), the highlight of CDS is that it discretizes all parts of Delay Differential Equation (DDE), including delay term, time domain term, parameter matrices, and most of all the differential term, by using the numerical iteration method, such as Euler’s method, to replace the direct integration scheme used in SDM and FDM, which greatly simplifies the complexity of the discretization iteration formula. The present study mainly provides a numerical framework than a method that can be theoretically used by different numerical methods for solving Ordinary Differential Equation (ODE), such as Euler’s method, Runge–Kutta method, Adam’s multistep methods, etc., in this framework for derivation of iteration formula with corresponding construction of coefficient matrix of iteration formula. This study presented CDS with Euler’s method (CDSEM) for solving the one degree-of-freedom problem (one DOF) and two DOF motion equations, which are usually used as benchmark problems. When compared with SDM and FDM, the benchmark results of one DOF and two DOF milling stability prediction show that CDSEM can obtain acceptable precision in most ranges. The computational efficiency of SDM and FDM was also determined, and the results show that CDS with Euler’s method is faster than FDM. Furthermore, large approximation parameters (small time interval) were selected by SDM and CDSEM, and the results show that CDS has high effectiveness, accuracy, and reliability.     

A differential quadrature algorithm for nonlinear Schrödinger equation

Numerical solutions of a nonlinear Schrödinger equation is obtained using the differential quadrature method based on polynomials for space discretization and Runge–Kutta of order four for time discretization. Five well-known test problems are studied to test the efficiency of the method. For the first two test problems, namely motion of single soliton and interaction of two solitons, numerical results are compared with earlier works. It is shown that results of other test problems agrees the theoretical results. The lowest two conserved quantities and their relative changes are computed for all test examples. In all cases, the differential quadrature Runge–Kutta combination generates numerical results with high accuracy.     

Linear stability of WENO schemes coupled with explicit Runge–Kutta schemes

This paper focuses on the results of the linear stability analysis of the finite‐difference weighted essentially non‐oscillatory (WENO) schemes with optimal weights. The standard WENO schemes between the third and 11th order, the order‐optimised WENO schemes of the sixth and eighth order and the bandwidth‐optimised WENO schemes of the third and fourth order are considered. Several explicit Runge–Kutta schemes including the recently published strong stability‐preserving explicit Runge–Kutta schemes are considered for time discretisation. The stability limits as well as dissipation and dispersion properties dependent on the Courant–Friedrichs–Lewy number are presented for a hyperbolic model equation. The different combinations of space and time discretisation schemes are compared in terms of their accuracy and efficiency. For a parabolic model equation, the viscous term is discretised with high‐order central differences. The stability limits for the parabolic problem are presented as well. Numerical results of linear test cases are shown. Copyright © 2011 John Wiley & Sons, Ltd.     

Finite element and implicit Runge–Kutta implementation of an acoustics–convection upstream resolution algorithm for the time‐dependent two‐dimensional Euler equations

The second of a two‐paper series, this paper details a solver for the characteristics‐bias system from the acoustics–convection upstream resolution algorithm for the Euler and Navier–Stokes equations. An integral formulation leads to several surface integrals that allow effective enforcement of boundary conditions. Also presented is a new multi‐dimensional procedure to enforce a pressure boundary condition at a subsonic outlet, a procedure that remains accurate and stable. A classical finite element Galerkin discretization of the integral formulation on any prescribed grid directly yields an optimal discretely conservative upstream approximation for the Euler and Navier–Stokes equations, an approximation that remains multi‐dimensional independently of the orientation of the reference axes and computational cells. The time‐dependent discrete equations are then integrated in time via an implicit Runge–Kutta procedure that in this paper is proven to remain absolutely non‐linearly stable for the spatially‐discrete Euler and Navier–Stokes equations and shown to converge rapidly to steady states, with maximum Courant number exceeding 100 for the linearized version. Even on relatively coarse grids, the acoustics–convection upstream resolution algorithm generates essentially non‐oscillatory solutions for subsonic, transonic and supersonic flows, encompassing oblique‐ and interacting‐shock fields that converge within 40 time steps and reflect reference exact solutions. Copyright © 2005 John Wiley & Sons, Ltd.     

Two‐dimensional compact finite difference immersed boundary method

We present a compact finite differences method for the calculation of two‐dimensional viscous flows in biological fluid dynamics applications. This is achieved by using body‐forces that allow for the imposition of boundary conditions in an immersed moving boundary that does not coincide with the computational grid. The unsteady, incompressible Navier–Stokes equations are solved in a Cartesian staggered grid with fourth‐order Runge–Kutta temporal discretization and fourth‐order compact schemes for spatial discretization, used to achieve highly accurate calculations. Special attention is given to the interpolation schemes on the boundary of the immersed body. The accuracy of the immersed boundary solver is verified through grid convergence studies. Validation of the method is done by comparison with reference experimental results. In order to demonstrate the application of the method, 2D small insect hovering flight is calculated and compared with available experimental and computational results. Copyright © 2009 John Wiley & Sons, Ltd.     

An efficient numerical method for solving Falkner–Skan boundary layer flows

In this paper a novel computational technique for the solution of nonlinear third‐order boundary value problems is presented. We demonstrate the application of the method by solving the famous Falkner–Skan equation on a semi‐infinite domain. Comparison with the results from other methods such as the homotopy analysis method and numerical methods demonstrates the accuracy, computational efficiency and robustness of this technique. Copyright © 2011 John Wiley & Sons, Ltd.