Calculation of three‐dimensional turbulent flow with a finite volume multigrid method

A numerical method for the efficient calculation of three‐dimensional incompressible turbulent flow in curvilinear co‐ordinates is presented. The mathematical model consists of the Reynolds averaged Navier–Stokes equations and the k–ε turbulence model. The numerical method is based on the SIMPLE pressure‐correction algorithm with finite volume discretization in curvilinear co‐ordinates. To accelerate the convergence of the solution method a full approximation scheme‐full multigrid (FAS‐FMG) method is utilized. The solution of the k–ε transport equations is embedded in the multigrid iteration. The improved convergence characteristic of the multigrid method is demonstrated by means of several calculations of three‐dimensional flow cases. Copyright © 1999 John Wiley & Sons, Ltd.     

On the efficiency of linearization schemes and coupled multigrid methods in the simulation of a 3D flow around a cylinder

This paper studies the efficiency of two ways to treat the non‐linear convective term in the time‐dependent incompressible Navier–Stokes equations and of two multigrid approaches for solving the arising linear algebraic saddle point problems. The Navier–Stokes equations are discretized by a second‐order implicit time stepping scheme and by inf–sup stable, higher order finite elements in space. The numerical studies are performed at a 3D flow around a cylinder. Copyright © 2005 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.     

A NON–LINEAR ADAPTED TRI–TREE MULTIGRID SOLVER FOR FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

An iterative adaptive equation multigrid solver for solving the implicit Navier–Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structur e which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element multigrid the Navier–Stokes equations are solved approximately. The solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. The iterative multigrid equation solver is preconditioned by incomplete LU factorization with coupled node fill-in. The non-linear Navier–Stokes equations are linearized by both the Newton method and grid adaption. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in.     

A NON-LINEAR ADAPTIVE FULL TRI-TREE MULTIGRID METHOD FOR THE MIXED FINITE ELEMENT FORMULATION OF THE NAVIER–STOKES EQUATIONS

The full adaptive multigrid method is based on the tri-tree grid generator. The solution of the Navier–Stokes equations is first found for a low Reynolds number. The velocity boundary conditions are then increased and the grid is adapted to the scaled solution. The scaled solution is then used as a start vector for the multigrid iterations. During the multigrid iterations the grid is first recoarsed a specified number of grid levels. The solution of the Navier–Stokes equations with the multigrid residual as right-hand side is smoothed in a fixed number of Newton iterations. The linear equation system in the Newton algorithm is solved iteratively by CGSTAB preconditioned by ILU factorization with coupled node fill-in. The full adaptive multigrid algorithm is demonstr ated for cavity flow. © 1997 by John Wiley & Sons, Ltd. Int. j. numer. methods fluids 24: 1037ndash;1047, 1997.     

Multigrid solution of the Navier–Stokes equations on highly stretched grids

Relaxation-based multigrid solvers for the steady incompressible Navier–Stokes equations are examined to determine their computational speed and robustness. Four relaxation methods were used as smoothers in a common tailored multigrid procedure. The resulting solvers were applied to three two-dimensional flow problems, over a range of Reynolds numbers, on both uniform and highly stretched grids. In all cases the L₂ norm of the velocity changes is reduced to 10^?6 in a few 10's of fine-grid sweeps. The results of the study are used to draw conciusions on the strengths and weaknesses of the individual relaxation methods as well as those of the overall multigrid procedure when used as a solver on highly stretched grids.     

MULTIGRID CONVERGENCE ACCELERATION FOR TURBULENT SUPERSONIC FLOWS

A multigrid convergence acceleration technique has been developed for solving both the Navier–Stokes and turbulence transport equations. For turbulence closure a low-Reynolds-number q–ω turbulence model is employed. To enable convergence, the stiff non-linear turbulent source terms have to be treated in a special way. Further modifications to standard multigrid methods are necessary for the resolution of shock waves in supersonic flows. An implicit LU algorithm is used for numerical time integration. Several ramped duct test cases are presented to demonstrate the improvements in performance of the numerical scheme. Cases with strong shock waves and separation are included. It is shown to be very effective to treat fluid and turbulence equations with the multigrid method. A comparison with experimental data demonstrates the accuracy of the q–ω turbulence closure for the simulation of supersonic flows. © 1997 by John Wiley & Sons, Ltd. Int. j. numer. methods fluids 24: 1019–1035, 1997.     

A semi-coarsening strategy for unstructured multigrid based on agglomeration

Extending multigrid concepts to the calculation of complex compressible flow is usually not straightforward. This is especially true when non-embedded grid hierarchies or volume agglomeration strategies are used to construct a gradation of unstructured grids. In this work, a multigrid method for solving second-order PDE's on stretched unstructured triangulations is studied. The finite volume agglomeration multigrid technique originally developed for solving the Euler equations is used (M.-H. Lallemand and A. Dervieux, in Multigrid Methods, Theory, Applications and Supercomputing, Marcel Dekker, 337–363 (1988)). First, a directional semi-coarsening strategy based on Poisson's equation is proposed. The second-order derivatives are approximated on each level by introducing a correction factor adapted to the semi-coarsening strategy. Then, this method is applied to solve the Poisson equation. It is extended to the 2D Reynolds-averaged Navier–Stokes equations with appropriate boundary treatment for low-Reynolds number turbulent flows. © 1998 John Wiley & Sons, Ltd.     

Benchmark solutions for the incompressible Navier–Stokes equations in general co-ordinates on staggered grids

Benchmark problems are solved with the steady incompressible Navier–Stokes equations discretized with a finite volume method in general curvilinear co-ordinates on a staggered grid. The problems solved are skewed driven cavity problems, recently proposed as non-orthogonal grid benchmark problems. The system of discretized equations is solved efficiently with a non-linear multigrid algorithm, in which a robust line smoother is implemented. Furthermore, another benchmark problem is introduced and solved in which a 90° change in grid line direction occurs.     

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.     

Higher order finite element methods and multigrid solvers in a benchmark problem for the 3D Navier–Stokes equations

This paper presents a numerical study of the 3D flow around a cylinder which was defined as a benchmark problem for the steady state Navier–Stokes equations within the DFG high‐priority research program flow simulation with high‐performance computers by Schafer and Turek (Vol. 52, Vieweg: Braunschweig, 1996). The first part of the study is a comparison of several finite element discretizations with respect to the accuracy of the computed benchmark parameters. It turns out that boundary fitted higher order finite element methods are in general most accurate. Our numerical study improves the hitherto existing reference values for the benchmark parameters considerably. The second part of the study deals with efficient and robust solvers for the discrete saddle point problems. All considered solvers are based on coupled multigrid methods. The flexible GMRES method with a multiple discretization multigrid method proves to be the best solver. Copyright © 2002 John Wiley & Sons, Ltd.     

A multigrid pseudospectral method for steady flow computation

In this work two‐dimensional steady flow problems are cast into a fixed‐point formulation, Q = F(Q). The non‐linear operator, F, is an approximate pseudospectral solver to the Navier–Stokes equations. To search the solution we employ Picard iteration together with a one‐dimensional error minimization and a random perturbation in case of getting stuck. A monotone convergence is brought out, and is greatly improved by using a multigrid strategy. The efficacy of this approach is demonstrated by computing flow between eccentric rotating cylinders, and the regularized lid‐driven cavity flow with Reynolds number up to 1000. Copyright © 2003 John Wiley & Sons, Ltd.     

用混合网格及各向异性多重网格法求解三维可压紊流流动

采用混合网格求解紊流Navier Stokes方程。在物面附近采用柱状网格 ,其他区域则采用完全非结构网格。方程的求解采用Jamson的有限体积法 ,紊流模型采用两层Baldwin Lomax代数紊流模型。用各向异性多重网格法来加速解的收敛。数值算例表明 ,用混合网格及各向异性多重网格求解紊流流动是非常有效的     

On coupling the Reynolds‐averaged Navier–Stokes equations with two‐equation turbulence model equations

Two methods for coupling the Reynolds‐averaged Navier–Stokes equations with the q–ω turbulence model equations on structured grid systems have been studied; namely a loosely coupled method and a strongly coupled method. The loosely coupled method first solves the Navier–Stokes equations with the turbulent viscosity fixed. In a subsequent step, the turbulence model equations are solved with all flow quantities fixed. On the other hand, the strongly coupled method solves the Reynolds‐averaged Navier–Stokes equations and the turbulence model equations simultaneously. In this paper, numerical stabilities of both methods in conjunction with the approximated factorization‐alternative direction implicit method are analysed. The effect of the turbulent kinetic energy terms in the governing equations on the convergence characteristics is also studied. The performance of the two methods is compared for several two‐ and three‐dimensional problems. Copyright © 2005 John Wiley & Sons, Ltd.     

Finite element modified method of characteristics for the Navier–Stokes equations

An algorithm based on the finite element modified method of characteristics (FEMMC) is presented to solve convection–diffusion, Burgers and unsteady incompressible Navier–Stokes equations for laminar flow. Solutions for these progressively more involved problems are presented so as to give numerical evidence for the robustness, good error characteristics and accuracy of our method. To solve the Navier–Stokes equations, an approach that can be conceived as a fractional step method is used. The innovative first stage of our method is a backward search and interpolation at the foot of the characteristics, which we identify as the convective step. In this particular work, this step is followed by a conjugate gradient solution of the remaining Stokes problem. Numerical results are presented for:

• a Convection–diffusion equation. Gaussian hill in a uniform rotating field.
• b Burgers equations with viscosity.
• c Navier–Stokes solution of lid‐driven cavity flow at relatively high Reynolds numbers.
• d Navier–Stokes solution of flow around a circular cylinder at Re=100.

Copyright © 2000 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.     

A multigrid method for steady incompressible navier-stokes equations based on flux difference splitting

The steady Navier–Stokes equations in primitive variables are discretized in conservative form by a vertex-centred finite volume method Flux difference splitting is applied to the convective part to obtain an upwind discretization. The diffusive part is discretized in the central way. In its first-order formulation, flux difference splitting leads to a discretization of so-called vector positive type. This allows the use of classical relaxation methods in collective form. An alternating line Gauss–Seidel relaxation method is chosen here. This relaxation method is used as a smoother in a multigrid method. The components of this multigrid method are: full approximation scheme with F-cycles, bilinear prolongation, full weighting for residual restriction and injection of grid functions. Higher-order accuracy is achieved by the flux extrapolation method. In this approach the first-order convective fluxes are modified by adding second-order corrections involving flux limiting. Here the simple MinMod limiter is chosen. In the multigrid formulation the second-order discrete system is solved by defect correction. Computational results are shown for the well known GAMM backward-facing step problem and for a channel with a half-circular obstruction.     

A linear solver based on algebraic multigrid and defect correction for the solution of adjoint RANS equations

A new solution approach for discrete adjoint Reynolds‐averaged Navier–Stokes equations is suggested. The approach is based on a combination of algebraic multigrid and defect correction. The efficient interplay of these two methods results in a fast and robust solution technique. Algebraic multigrid deals very well with unstructured grids, and defect correction completes it in such a way that a required second‐order accuracy of the solution is achieved. The performance of the suggested solution approach is demonstrated on a number of representative benchmarks.Copyright © 2014 John Wiley & Sons, Ltd.     

Control of Navier–Stokes equations by means of mode reduction

In a previous work (Park HM, Lee MW. An efficient method of solving the Navier–Stokes equation for the flow control. International Journal of Numerical Methods in Engineering 1998; 41 : 1131–1151), the authors proposed an efficient method of solving the Navier–Stokes equations by reducing their number of modes. Employing the empirical eigenfunctions of the Karhunen–Loève decomposition as basis functions of a Galerkin procedure, one can a priori limit the function space considered to the smallest linear sub‐space that is sufficient to describe the observed phenomena, and consequently, reduce the Navier–Stokes equations defined on a complicated geometry to a set of ordinary differential equations with a minimum degree of freedom. In the present work, we apply this technique, termed the Karhunen–Loève Galerkin procedure, to a pointwise control problem of Navier–Stokes equations. The Karhunen–Loève Galerkin procedure is found to be much more efficient than the traditional method, such as finite difference method in obtaining optimal control profiles when the minimization of the objective function has been done by using a conjugate gradient method.     

The robustness issue on multigrid schemes applied to the Navier–Stokes equations for laminar and turbulent,incompressible and compressible flows

The paper's leitmotiv is condensed in one word: robustness. This is a real hindrance for the successful implementation of any multigrid scheme for solving the Navier–Stokes set of equations. In this paper, many hints are given to improve this issue. Instead of looking for the best possible speed‐up rate for a particular set of problems, at a given regime and in a given condition, the authors propose some ideas pursuing reasonable speed‐up rates in any situation. In a previous paper, the authors presented a multigrid method for solving the incompressible turbulent RANS equations, with particular care in the robustness and flexibility of the solution scheme. Here, these concepts are further developed and extended to compressible laminar and turbulent flows. This goal is achieved by introducing a non‐linear multigrid scheme for compressible laminar (NS equations) and turbulent flow (RANS equations), taking benefit of a convenient master–slave implementation strategy. Copyright © 2004 John Wiley & Sons, Ltd.