A new multigrid algorithm for non-linear equations in conjunction with time-marching procedures

Full approximate storage (FAS) multigrid algorithm is the most commonly used multigrid algorithm for non-linear equations. The algorithm initially developed for steady-state equations was later extended to obtain steady-state solutions employing unsteady equations. In extending the FAS algorithm for the steady-state non-linear equations to unsteady non-linear equations, the FAS algorithm does not to take into account that the governing equations are typically linearized in time before they are solved. Thus, there is a scope to develop a new multigrid algorithm to apply the multigrid technique to the equations linearized in time. In the present work, such an algorithm is developed exploring this possibility and is implemented for two-dimensional incompressible and compressible flows coupled with explicit time marching procedures. The results of the new algorithm compare favourably with those of the FAS multigrid method and single grid.     

A finite volume unstructured multigrid method for efficient computation of unsteady incompressible viscous flows

An unstructured non‐nested multigrid method is presented for efficient simulation of unsteady incompressible Navier–Stokes flows. The Navier–Stokes solver is based on the artificial compressibility approach and a higher‐order characteristics‐based finite‐volume scheme on unstructured grids. Unsteady flow is calculated with an implicit dual time stepping scheme. For efficient computation of unsteady viscous flows over complex geometries, an unstructured multigrid method is developed to speed up the convergence rate of the dual time stepping calculation. The multigrid method is used to simulate the steady and unsteady incompressible viscous flows over a circular cylinder for validation and performance evaluation purposes. It is found that the multigrid method with three levels of grids results in a 75% reduction in CPU time for the steady flow calculation and 55% reduction for the unsteady flow calculation, compared with its single grid counterparts. The results obtained are compared with numerical solutions obtained by other researchers as well as experimental measurements wherever available and good agreements are obtained. Copyright © 2004 John Wiley & Sons, Ltd.     

基于聚合多重网格方法的跨音速颤振的数值模拟

采用流固耦合方法对跨音速颤振进行了数值模拟。流体方面在非结构网格上用有限体积方法求解了Euler方程;结构方面则求解了后掠机翼典型剖面的结构模态方程。时间推进采用双时间步长：对每一真实时间步,都通过基于聚合多重网格方法的伪时间步推进,对流体和结构方程交替迭代．得到一个稳态的流固耦合的解。文章最后给出了NACA64A010翼型剖面的跨音速颤振边界．与相关文献的计算结果符合良好。     

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

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

Multigrid solutions of the Euler and Navier–Stokes equations on unstructured grids

A computationally efficient multigrid algorithm for upwind edge‐based finite element schemes is developed for the solution of the two‐dimensional Euler and Navier–Stokes equations on unstructured triangular grids. The basic smoother is based upon a Galerkin approximation employing an edge‐based formulation with the explicit addition of an upwind‐type local extremum diminishing (LED) method. An explicit time stepping method is used to advance the solution towards the steady state. Fully unstructured grids are employed to increase the flexibility of the proposed algorithm. A full approximation storage (FAS) algorithm is used as the basic multigrid acceleration procedure. Copyright © 1999 John Wiley & Sons, Ltd.     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Symmetric Gauss-Seidel multigrid solution of the Euler equations on structured and unstructured grids

The efficient symmetric Gauss-Seidel (SGS) algorithm for solving the Euler equations of inviscid, compressible flow on structured grids, developed in collaboration with Jameson of Stanford University, is extended to unstructured grids. The algorithm uses a nonlinear formulation of an SGS solver, implemented within the framework of multigrid. The earlier form of the algorithm used the natural (lexicographic) ordering of the mesh cells available on structured grids for the SGS sweeps, but a number of features of the method that are believed to contribute to its success can also be implemented for computations on unstructured grids. The present paper reviews, the features of the SGS multigrid solver for structured gr0ids, including its nonlinear implementation, its use of “absolute” Jacobian matrix preconditioning, and its incorporation of multigrid, and then describes the incorporation of these features into an algorithm suitable for computations on unstructured grids. The implementation on unstructured grids is based on the agglomerated multigrid method developed by Sørensen, which uses an explicit Runge-Kutta smoothing algorithm. Results of computations for steady, transonic flows past two-dimensional airfoils are presented, and the efficiency of the method is evaluated for computations on both structured and unstructured meshes.     

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.     

Segmented multigrid domain decomposition procedure for incompressible viscous flows

The application of grid stretching or grid adaptation is generally required in order to optimize the distribution of nodal points for fluid-dynamic simulation. This is necessitated by the presence of disjoint high gradient zones, that represent boundary or free shear layers, reversed flow or vortical flow regions, triple deck structures, etc. A domain decomposition method can be used in conjunction with an adaptive multigrid algorithm to provide an effective methodology for the development of optimal grids. In the present study, the Navier-Stokes (NS) equations are approximated with a reduced Navier-Stokes (RNS) system, that represents the lowest-order terms in an asymptotic Re expansion. This system allows for simplified boundary conditions, more generality in the location of the outflow boundary, and ensures mass conservation in all subdomain grid interfaces, as well as at the outflow boundary. The higher-order (NS) diffusion terms are included through a deferred corrector, in selected subdomains, when necessary. Adaptivity in the direction of refinement is achieved by grid splitting or domain decomposition in each level of the multigrid procedure. Normalized truncation error estimates of key derivatives are used to determine the boundaries of these subdomains. The refinement is optimized in two co-ordinate directions independently. Multidirectional adaptivity eliminates the need for grid stretching so that uniform grids are specified in each subdomain. The overall grid consists of multiple domains with different meshes and is, therefore, heavily graded. Results and computational efficiency are discussed for the laminar flow over a finite length plate and for the laminar internal flow in a backward-facing step channel.     

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.     

A volume-tracking method for incompressible multifluid flows with large density variations

A numerical technique (FGVT) for solving the time-dependent incompressible Navier–Stokes equations in fluid flows with large density variations is presented for staggered grids. Mass conservation is based on a volume tracking method and incorporates a piecewise-linear interface reconstruction on a grid twice as fine as the velocity–pressure grid. It also uses a special flux-corrected transport algorithm for momentum advection, a multigrid algorithm for solving a pressure-correction equation and a surface tension algorithm that is robust and stable. In principle, the method conserves both mass and momentum exactly, and maintains extremely sharp fluid interfaces. Applications of the numerical method to prediction of two-dimensional bubble rise in an inclined channel and a bubble bursting through an interface are presented. © 1998 John Wiley & Sons, Ltd.     

ADAPTIVE LINEARIZATION AND GRID ITERATIONS WITH THE TRI-TREE MULTIGRID REFINEMENT–RECOARSEMENT ALGORITHM FOR THE NAVIER–STOKES EQUATIONS

The tri-tree algorithm for refinements and recoarsements of finite element grids is explored. The refinement–recoarsement algorithm not only provides an accurate solution in certain parts of the grid but also has a major influence on the finite element equation system itself. The refinements of the grid lead to a more symmetric and linear equation matrix. The recoarsements will ensure that the grid is not finer than is necessary for preventing divergence in an iterative solution procedure. The refinement–recoarsement algorithm is a dynamic procedure and the grid is adapted to the instant solution. In the tri-tree multigrid algorithm the solution from a coarser grid is scaled relatively to the increase in velocity boundary condition for the finer grid. In order to have a good start vector for the solution of the finer grid, the global Reynolds number or velocity boundary condition should not be subject to large changes. For each grid and velocity solution the element Reynolds number is computed and used as the grid adaption indicator during the refinement–recoarsement procedure. The iterative tri-tree multigrid method includes iterations with respect to the grid. At each Reynolds number the same boundary condition s are applied and the grid is adapted to the solution iteratively until the number of unknowns and elements in the grid becomes constant. In the present paper the following properties of the tri-tree algorithm are explored: the influence of the increase in boundary velocities and the size of the grid adaption indicator on the amount of work for solving the equations, the number of linear iterations and the solution error estimate between grid levels. The present work indicates that in addition to the linear and non-linear iterations, attention should also be given to grid adaption iterations. © 1997 by John Wiley & Sons, Ltd.     

Implicit meanflow–multigrid algorithms for Reynolds stress model computation of 3‐D anisotropy‐driven and compressible flows

The present paper investigates the multigrid (MG) acceleration of compressible Reynolds‐averaged Navier–Stokes computations using Reynolds‐stress model 7‐equation turbulence closures, as well as lower‐level 2‐equation models. The basic single‐grid SG algorithm combines upwind‐biased discretization with a subiterative local‐dual‐time‐stepping time‐integration procedure. MG acceleration, using characteristic MG restriction and prolongation operators, is applied on meanflow variables only (MF–MG), turbulence variables being simply injected onto coarser grids. A previously developed non‐time‐consistent (for steady flows) full‐approximation‐multigrid (s–MG) is assessed for 3‐D anisotropy‐driven and/or separated flows, which are dominated by the convergence of turbulence variables. Even for these difficult test cases CPU‐speed‐ups r_CPUSUP∈[3, 5] are obtained. Alternative, potentially time‐consistent approaches (unsteady u–MG), where MG acceleration is applied at each subiteration, are also examined, using different subiterative strategies, MG cycles, and turbulence models. For 2‐D shock wave/turbulent boundary layer interaction, the fastest s–MG approach, with a V(2, 0) sawtooth cycle, systematically yields CPU‐speed‐ups of 5±½, quasi‐independent of the particular turbulence closure used. Copyright © 2008 John Wiley & Sons, Ltd.     

A grid deformation technique for unsteady flow computations

A grid deformation technique is presented here based on a transfinite interpolation algorithm applied to the grid displacements. The method, tested using a two‐dimensional flow solver that uses an implicit dual‐time method for the solution of the unsteady Euler equations on deforming grids, is applicable to problems with time varying geometries arising from aeroelasticity and free surface marine problems. The present work is placed into a multi‐block framework and fits into the development of a generally applicable parallel multi‐block flow solver. The effect of grid deformation is examined and comparison with rigidly rotated grids is made for a series of pitching aerofoil test cases selected from the AGARD aeroelastic configurations for the NACA0012 aerofoil. The effect of using a geometric conservation law is also examined. Finally, a demonstration test case for the Williams aerofoil with an oscillating flap is presented, showing the capability of the grid deformation technique. Copyright © 2000 John Wiley & Sons, Ltd.     

A PARALLEL BLOCK-STRUCTURED MULTIGRID METHOD FOR THE PREDICTION OF INCOMPRESSIBLE FLOWS

In this paper a parallel multigrid finite volume solver for the prediction of steady and unsteady flows in complex geometries is presented. For the handling of the complexity of the geometry and for the parallelization a unified approach connected with the concept of block-structured grids is employed. The parallel implementation is based on grid partitioning with automatic load balancing and follows the message-passing concept, ensuring a high degree of portability. A high numerical efficiency is obtained by a non-linear multigrid method with a pressure correction scheme as smoother. By a number of numerical experiments on various parallel computers the method is investigated with respect to its numerical and parallel efficiency. The results illustrate that the high performance of the underlying sequential multigrid algorithm can largely be retained in the parallel implementation and that the proposed method is well suited for solving complex flow problems on parallel computers with high efficiency.     

Multigrid convergence acceleration for implicit and explicit solution of Euler equations on unstructured grids

The multigrid method is one of the most efficient techniques for convergence acceleration of iterative methods. In this method, a grid coarsening algorithm is required. Here, an agglomeration scheme is introduced, which is applicable in both cell‐center and cell‐vertex 2 and 3D discretizations. A new implicit formulation is presented, which results in better computation efficiency, when added to the multigrid scheme. A few simple procedures are also proposed and applied to provide even higher convergence acceleration. The Euler equations are solved on an unstructured grid around standard transonic configurations to validate the algorithm and to assess its superiority to conventional explicit agglomeration schemes. The scheme is applied to 2 and 3D test cases using both cell‐center and cell‐vertex discretizations. Copyright © 2009 John Wiley & Sons, Ltd.     

An unstructured/structured multi‐layer hybrid grid method and its application

A multi‐layer hybrid grid method is constructed to simulate complex flow field around 2‐D and 3‐D configuration. The method combines Cartesian grids with structured grids and triangular meshes to provide great flexibility in discretizing a domain. We generate the body‐fitted structured grids near the wall surface and the Cartesian grids for the far field. In addition, we regard the triangular meshes as an adhesive to link each grid part. Coupled with a tree data structure, the Cartesian grid is generated automatically through a cell‐cutting algorithm. The grid merging methodology is discussed, which can smooth hybrid grids and improve the quality of the grids. A cell‐centred finite volume flow solver has been developed in combination with a dual‐time stepping scheme. The flow solver supports arbitrary control volume cells. Both inviscid and viscous flows are computed by solving the Euler and Navier–Stokes equations. The above methods and algorithms have been validated on some test cases. Computed results are presented and compared with experimental data. Copyright © 2006 John Wiley & Sons, Ltd.     

Numerical solution of the unsteady Euler equations for airfoils using approximate boundary conditions

This paper presents an efficient numerical method for solving the unsteady Euler equations on stationary rectilinear grids. Boundary conditions on the surface of an airfoil are implemented by using their first-order expansions on the mean chord line. The method is not restricted to flows with small disturbances since there are no restrictions on the mean angle of attack of the airfoil. The mathematical formulation and the numerical implementation of the wall boundary conditions in a fully implicit time-accurate finite-volume Euler scheme are described. Unsteady transonic flows about an oscillating NACA 0012 airfoil are calculated. Computational results compare well with Euler solutions by the full boundary conditions on a body-fitted curvilinear grid and published experimental data. This study establishes the feasibility for computing unsteady fluid-structure interaction problems, where the use of a stationary rectilinear grid offers substantial advantages in saving computer time and program design since it does not require the generation and implementation of time-dependent body-fitted grids.     

Numerical computation of unsteady incompressible flow in complex geometry using a composite multigrid technique

This paper presents a composite multigrid method and its application to a geometrically complex flow. The treatment of the interior boundary conditions within a composite multigrid strategy is described in detail for a 1D model equation. For the Navier-Stokes equations a staggered grid technique is adopted for spatial discretization and a fractional step method is used for the time advance. Lid-driven cavity flows are used to demonstrate the effectiveness of the method.     

The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in‐house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block‐structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.