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.     

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.     

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.     

Application of point implicit Runge–Kutta methods to inviscid and laminar flow problems using AUSM and AUSM+ upwinding

Explicit Runge–Kutta methods preconditioned by a pointwise matrix valued preconditioner can significantly improve the convergence rate to approximate steady state solutions of laminar flows. This has been shown for central discretisation schemes and Roe upwinding. Since the first-order approximation to the inviscid flux assuming constant weighting of the dissipative terms is given by the absolute value of the Roe matrix, the construction of the preconditioner is rather simple compared to other upwind techniques. However, in this article we show that similar improvements in the convergence rates can also be obtained for the AUSM⁺ scheme. Following the ideas for the central and Roe schemes, the preconditioner is obtained by a first-order approximation to the derivative of the convective flux. Viscous terms are included into the preconditioner considering a thin shear layer approximation. A complete derivation of the derivative terms is shown. In numerical examples, we demonstrate the improved convergence rates when compared with a standard explicit Runge–Kutta method accelerated with local time stepping.     

A hybrid time stepping scheme combining explicit Runge–Kutta with implicit LU‐SGS for Navier–Stokes equations

A hybrid time stepping scheme is developed and implemented by a combination of explicit Runge–Kutta with implicit LU‐SGS scheme at the level of system matrix. In this method, the explicit scheme is applied to those grid cells of blocks that have large local time steps; meanwhile, the implicit scheme is applied to other grid cells of blocks that have smaller allowable local time steps in the same flow field. As a result, the discretized governing equations can be expressed as a compound of explicit and implicit matrix operator. The proposed method has been used to compute the steady transonic turbulent flow over the RAE 2822 airfoil. The numerical results are found to be in excellent agreement with the experimental data. In the validation case, the present scheme saved at least 50% of the memory resources compared with the fully implicit LU‐SGS. Copyright © 2015 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.     

ADAPTIVE SOLUTIONS FOR UNSTEADY LAMINAR FLOWS ON UNSTRUCTURED GRIDS

An adaptive finite volume method for the simulation of time-dependent, viscous flow is presented. The Navier–Stokes equations are discretized by central schemes on unstructured grids and solved by an explicit Runge–Kutta method. The essential topics of the present study are a new concept for a local Runge–Kutta time-stepping scheme, called multisequence Runge–Kutta, which reduces the severe stability restriction in unsteady problems, a common grid generation and adaptation procedure and the application of dynamic grids for capturing moving flow structures. Results are presented for laminar, separated flow around an aerofoil with a flap.     

WENO schemes applied to the quasi-relativistic Vlasov–Maxwell model for laser–plasma interaction

In this paper we focus on WENO-based methods for the simulation of the 1D Quasi-Relativistic Vlasov–Maxwell (QRVM) model used to describe how a laser wave interacts with and heats a plasma by penetrating into it. We propose several non-oscillatory methods based on either Runge–Kutta (explicit) or Time-Splitting (implicit) time discretizations. We then show preliminary numerical experiments.     

Finite volume methods for unidirectional dispersive wave models

We extend the framework of the finite volume method to dispersive unidirectional water wave propagation in one space dimension. In particular, we consider a KdV–BBM‐type equation. Explicit and implicit–explicit Runge–Kutta‐type methods are used for time discretizations. The fully discrete schemes are validated by direct comparisons to analytic solutions. Invariants' conservation properties are also studied. Main applications include important nonlinear phenomena such as dispersive shock wave formation, solitary waves, and their various interactions. Copyright © 2012 John Wiley & Sons, Ltd.     

Implicit time accurate simulation of unsteady flow

Implicit time integration was studied in the context of unsteady shock‐boundary layer interaction flow. With an explicit second‐order Runge–Kutta scheme, a reference solution to compare with the implicit second‐order Crank–Nicolson scheme was determined. The time step in the explicit scheme is restricted by both temporal accuracy as well as stability requirements, whereas in the A‐stable implicit scheme, the time step has to obey temporal resolution requirements and numerical convergence conditions. The non‐linear discrete equations for each time step are solved iteratively by adding a pseudo‐time derivative. The quasi‐Newton approach is adopted and the linear systems that arise are approximately solved with a symmetric block Gauss–Seidel solver. As a guiding principle for properly setting numerical time integration parameters that yield an efficient time accurate capturing of the solution, the global error caused by the temporal integration is compared with the error resulting from the spatial discretization. Focus is on the sensitivity of properties of the solution in relation to the time step. Numerical simulations show that the time step needed for acceptable accuracy can be considerably larger than the explicit stability time step; typical ratios range from 20 to 80. At large time steps, convergence problems that are closely related to a highly complex structure of the basins of attraction of the iterative method may occur. Copyright © 2001 John Wiley & Sons, Ltd.     

带约束多体系统动力学方程的隐式算法

研究了带约束多体系统隐式算法,用子矩阵的形式推导出了多体系统正则方程的Ｊａｃｏｂｉ矩阵,它适用于多种隐式算法并给出了隐式Ｒｕｎｇｅ－Ｋｕｔｔａ算法,最后用一算例表明了隐式算法的计算效率和精度明显优于算法。     

Parameter investigation with line-implicit lower–upper symmetric Gauss–Seidel on 3D stretched grids

An implicit lower–upper symmetric Gauss–Seidel (LU-SGS) solver has been implemented as a multigrid smoother combined with a line-implicit method as an acceleration technique for Reynolds-averaged Navier–Stokes (RANS) simulation on stretched meshes. The computational fluid dynamics code concerned is Edge, an edge-based finite volume Navier–Stokes flow solver for structured and unstructured grids. The paper focuses on the investigation of the parameters related to our novel line-implicit LU-SGS solver for convergence acceleration on 3D RANS meshes. The LU-SGS parameters are defined as the Courant–Friedrichs–Lewy number, the left-hand side dissipation, and the convergence of iterative solution of the linear problem arising from the linearisation of the implicit scheme. The influence of these parameters on the overall convergence is presented and default values are defined for maximum convergence acceleration. The optimised settings are applied to 3D RANS computations for comparison with explicit and line-implicit Runge–Kutta smoothing. For most of the cases, a computing time acceleration of the order of 2 is found depending on the mesh type, namely the boundary layer and the magnitude of residual reduction.     

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.     

A space-time lower–upper symmetric Gauss–Seidel scheme for the time-spectral method

The time-spectral method (TSM) offers the advantage of increased order of accuracy compared to methods using finite-difference in time for periodic unsteady flow problems. Explicit Runge–Kutta pseudo-time marching and implicit schemes have been developed to solve iteratively the space-time coupled nonlinear equations resulting from TSM. Convergence of the explicit schemes is slow because of the stringent time-step limit. Many implicit methods have been developed for TSM. Their computational efficiency is, however, still limited in practice because of delayed implicit temporal coupling, multiple iterative loops, costly matrix operations, or lack of strong diagonal dominance of the implicit operator matrix. To overcome these shortcomings, an efficient space-time lower–upper symmetric Gauss–Seidel (ST-LU-SGS) implicit scheme with multigrid acceleration is presented. In this scheme, the implicit temporal coupling term is split as one additional dimension of space in the LU-SGS sweeps. To improve numerical stability for periodic flows with high frequency, a modification to the ST-LU-SGS scheme is proposed. Numerical results show that fast convergence is achieved using large or even infinite Courant–Friedrichs–Lewy (CFL) numbers for unsteady flow problems with moderately high frequency and with the use of moderately high numbers of time intervals. The ST-LU-SGS implicit scheme is also found to work well in calculating periodic flow problems where the frequency is not known a priori and needed to be determined by using a combined Fourier analysis and gradient-based search algorithm.     

Technique for selecting the functions of the constitutive equations of creep and long-term strength with one scalar damage parameter

The strain-strength characteristics of aerostructures made of hardening materials under uniaxial tension in creep conditions are determined. The problem is reduced to a system of ordinary differential equations of the kinetic theory of creep with one scalar damage parameter. The approximate solutions of the problem are obtained with the help of the implicit Euler method and of the arc length method in combination with the explicit methods of the Runge–Kutta family for cylindrical St.45 steel samples and 3V titanium alloy plates.     

Numerical experiments with several variant WENO schemes for the Euler equations

Numerical experiments with several variants of the original weighted essentially non‐oscillatory (WENO) schemes (J. Comput. Phys. 1996; 126 :202–228) including anti‐diffusive flux corrections, the mapped WENO scheme, and modified smoothness indicator are tested for the Euler equations. The TVD Runge–Kutta explicit time‐integrating scheme is adopted for unsteady flow computations and lower–upper symmetric‐Gauss–Seidel (LU‐SGS) implicit method is employed for the computation of steady‐state solutions. A numerical flux of the variant WENO scheme in flux limiter form is presented, which consists of first‐order and high‐order fluxes and allows for a more flexible choice of low‐order schemes. Computations of unsteady oblique shock wave diffraction over a wedge and steady transonic flows over NACA 0012 and RAE 2822 airfoils are presented to test and compare the methods. Various aspects of the variant WENO methods including contact discontinuity sharpening and steady‐state convergence rate are examined. By using the WENO scheme with anti‐diffusive flux corrections, the present solutions indicate that good convergence rate can be achieved and high‐order accuracy is maintained and contact discontinuities are sharpened markedly as compared with the original WENO schemes on the same meshes. Copyright © 2008 John Wiley & Sons, Ltd.     

Modelling and numerical methods for the dynamics of impurities in a gas

The dynamics of a mixture of impurities in a gas can be represented by a system of linear Boltzmann equations for hard spheres. We assume that the background is in thermodynamic equilibrium and that the polluting particles are sufficiently few (in comparison with the background molecules) to admit that there are no collisions among couples of them. In order to derive non‐trivial hydrodynamic models, we close the Euler system around local Maxwellian's which are not equilibrium states. The kinetic model is solved by using a Monte Carlo method, the hydrodynamic one by implicit–explicit Runge–Kutta schemes with weighted essentially non‐oscillatory reconstruction (J. Sci. Comput. 2005; 25 (1–2):129–155). Several numerical tests are then computed in order to compare the results obtained with the kinetic and the hydrodynamic models. Copyright © 2007 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.     

Implicit–explicit finite‐difference lattice Boltzmann method with viscid compressible model for gas oscillating patterns in a resonator

Difficulties for the conventional computational fluid dynamics and the standard lattice Boltzmann method (LBM) to study the gas oscillating patterns in a resonator have been discussed. In light of the recent progresses in the LBM world, we are now able to deal with the compressibility and non‐linear shock wave effects in the resonator. A lattice Boltzmann model for viscid compressible flows is introduced firstly. Then, the Boltzmann equation with the Bhatnagar–Gross–Krook approximation is solved by the finite‐difference method with a third‐order implicit–explicit (IMEX) Runge–Kutta scheme for time discretization, and a fifth‐order weighted essentially non‐oscillatory (WENO) scheme for space discretization. Numerical results obtained in this study agree quantitatively with both experimental data available and those using conventional numerical methods. Moreover, with the IMEX finite‐difference LBM (FDLBM), the computational convergence rate can be significantly improved compared with the previous FDLBM and standard LBM. This study can also be applied for simulating some more complex phenomena in a thermoacoustics engine. Copyright © 2008 John Wiley & Sons, Ltd.     

Runge–Kutta methods for a semi-analytical prediction of milling stability

On the basis of Runge–Kutta methods, this paper proposes two semi-analytical methods to predict the stability of milling processes taking a regenerative effect into account. The corresponding dynamics model is concluded as a coefficient-varying periodic differential equation with a single time delay. Floquet theory is adopted to predict the stability of machining operations by judging the eigenvalues of the state transition matrix. This paper firstly presents the classical fourth-order Runge–Kutta method (CRKM) to solve the differential equation. Through numerical tests and analysis, the convergence rate and the approximation order of the CRKM is not as high as expected, and only small discrete time step size could ensure high computation accuracy. In order to improve the performance of the CRKM, this paper then presents a generalized form of the Runge–Kutta method (GRKM) based on the Volterra integral equation of the second kind. The GRKM has higher convergence rate and computation accuracy, validated by comparisons with the semi-discretization method, etc. Stability lobes of a single degree of freedom (DOF) milling model and a two DOF milling model with the GRKM are provided in this paper.