A multigrid method for recirculating flows

The use of multigrid methods in complex fluid flow problems is recent and still under development. In this paper we present a multigrid method for the incompressible Navier-Stokes equations. The distinctive features of the method are the use of a pressure-correction method as a smoother and a novel continuity-preserving manner of grid coarsening. The shear-driven cavity problem is used as a test case to demonstrate the efficiency of the method.     

基于高阶和高效格式的悬停旋翼可压缩无粘绕流的计算

发展了一种基于高精度和高效格式计算悬停旋翼复杂绕流的隐式有限体积方法。控制方程为Euler方程,其中对流项通量的左右状态量采用五阶加权基本无振荡(WENO)格式重构,时间推进应用隐式LU-SGS算法,为进一步加速收敛,采用三层V循环多重网格松弛方法。考虑到多重网格方法的思想以及五阶WENO格式涉及6个网格单元,建议仅在最细网格上使用WENO格式。计算结果表明本文方法能有效捕捉激波,对尾迹也有较高分辨率,基于隐式LU-SGS算法的多重网格方法能有效提高计算效率。     

A dynamic injection operator in a multigrid solution of convection-diffusion equations

A multigrid method is studied for the solution of a linear system resulting from the high-order nine-point discretization of the convection-diffusion equations. The residual injection operator is used as a substitute for the usual full-weighting in the multigrid process. A heuristic analysis is given to obtain a dynamic injection operator that is cost-effective for both diffusion- and convection-dominated problems. Numerical experiments are employed to test the stability and efficiency of the proposed method. © 1998 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.     

A Hybrid Domain Decomposition and Multigrid Method for the Acceleration of Compressible Viscous Flow Calculations on Unstructured Triangular Meshes

This paper is concerned with the formulation and the evaluation of a hybrid solution method that makes use of domain decomposition and multigrid principles for the calculation of two-dimensional compressible viscous flows on unstructured triangular meshes. More precisely, a non-overlapping additive domain decomposition method is used to coordinate concurrent subdomain solutions with a multigrid method. This hybrid method is developed in the context of a flow solver for the Navier-Stokes equations which is based on a combined finite element/finite volume formulation on unstructured triangular meshes. Time integration of the resulting semi-discrete equations is performed using a linearized backward Euler implicit scheme. As a result, each pseudo time step requires the solution of a sparse linear system. In this study, a non-overlapping domain decomposition algorithm is used for advancing the solution at each implicit time step. Algebraically, the Schwarz algorithm is equivalent to a Jacobi iteration on a linear system whose matrix has a block structure. A substructuring technique can be applied to this matrix in order to obtain a fully implicit scheme in terms of interface unknowns. In the present approach, the interface unknowns are numerical fluxes. The interface system is solved by means of a full GMRES method. Here, the local system solves that are induced by matrix-vector products with the interface operator, are performed using a multigrid by volume agglomeration method. The resulting hybrid domain decomposition and multigrid solver is applied to the computation of several steady flows around a geometry of NACA0012 airfoil.     

基于SIMPLER算法的多重网格方法研究

以二维方腔顶盖驱动流为模型,将多重网格方法和SIMPLER算法进行耦合,对不同雷诺数下多重网格加速SIMPLER算法和SIMPLER算法的计算效率进行了对比,数值计算表明:多重网格加速SIMPLER算法不仅能够解决SIMPLER算法不能准确模拟较高雷诺数流场的问题,而且其计算效率远远高于SIMPLER算法.本文也对松弛因子的选取、多重网格实现形式以及网格层数对多重网格加速SIMPLER算法的影响进行了研究,从而为多重网格加速SIMPLER算法的实施提供了计算技术.     

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

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

A Newton multigrid method for steady-state shallow water equations with topography and dry areas

A Newton multigrid method is developed for one-dimensional (1D) and two-dimensional (2D) steady-state shallow water equations (SWEs) with topography and dry areas. The nonlinear system arising from the well-balanced finite volume discretization of the steady-state SWEs is solved by the Newton method as the outer iteration and a geometric multigrid method with the block symmetric Gauss-Seidel smoother as the inner iteration. The proposed Newton multigrid method makes use of the local residual to regularize the Jacobian matrix of the Newton iteration, and can handle the steady-state problem with wet/dry transition. Several numerical experiments are conducted to demonstrate the efficiency, robustness, and well-balanced property of the proposed method. The relation between the convergence behavior of the Newton multigrid method and the distribution of the eigenvalues of the iteration matrix is detailedly discussed.     

THE PARALLEL BLOCK ADAPTIVE MULTIGRID METHOD FOR THE IMPLICIT SOLUTION OF THE EULER EQUATIONS

A method capable of solving very fast and robust complex non-linear systems of equations is presented. The block adaptive multigrid (BAM) method combines mesh adaptive techniques with multigrid and domain decomposition methods. The overall method is based on the FAS multigrid, but instead of using global grids, locally enriched subgrids are also employed in regions where excessive solution errors are encountered. The final mesh is a composite grid with uniform rectangular subgrids of various mesh densities. The regions where finer grid resolution is necessary are detected using an estimation of the solution error by comparing solutions between grid levels. Furthermore, an alternative domain decomposition strategy has been developed to take advantage of parallel computing machines. The proposed method has been applied to an implicit upwind Euler code (EuFlex) for the solution of complex transonic flows around aerofoils. The efficiency and robustness of the BAM method are demonstrated for two popular inviscid test cases. Up to 19-fold acceleration with respect to the single-grid solution has been achieved, but a further twofold speed-up is possible on four-processor parallel computers.     

多重网格法与Newton-Raphson法耦合求线弹流数值解

利用多重网格算法,在最粗网格上,采用Newton-Raphson迭代法模式精解线接触弹流非线性方程组,充分利用了多重网格法与Newton-Raphson法各自的优点,计算实践表明,求解弹流问题的数值解过程在收敛与稳定性方面均有较大改善,且有相当宽的载荷参数适用范围。     

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.     

Multigrid Models of Composite Materials of Irregular Structure with a Small Filling Ratio

This paper considers composites consisting of a set of typical composite multigrid finite elements whose structures are regular and different. Mean local errors are proposed for multigrid modeling of composites.     

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.     

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.     

An ILU smoother for the incompressible Navier-Stokes equations in general co-ordinates

The solution of the incompressible Navier-Stokes equations in general two- and three-dimensional domains using a multigrid method is considered. Because a great variety of boundary-fitted grids may occur, robustness is at a premium. Therefore a new ILU smoother called CILU (collective ILU) is described, based on r-transformations. In CILU the matrix that is factorized is block-structured, with blocks corresponding to the set of physical variables. A multigrid algorithm using CILU as smoother is investigated. The performance of the algorithm in two and three dimensions is assessed by numerical experments. The results show that CILU is a good smoother for the incompressible Navier-Stokes equations discretized on general non-orthogonal curvilinear grids.     

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.     

使用不等距多重网格技术求解线接触热弹流润滑问题

使用不等距多重网格法求解了线接触热弹流润滑问题 .结果表明 :与等距多重网格法相比 ,新解法虽不能提高数值求解的稳定性 ,却能得到更为精确的压力、膜厚及温度分布 ;计算结果表明中载下第二压力峰是光滑的     

An adaptive multigrid finite-volume scheme for incompressible Navier–Stokes equations

An algorithm for the solutions of the two-dimensional incompressible Navier–Stokes equations is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. It is based on an artificial compressibility method and uses higher-order upwind finite-volume techniques for the convective terms and a second-order finite-volume technique for the viscous terms. Three upwind schemes for discretizing convective terms are proposed here. An interesting result is that the solutions computed by one of them is not sensitive to the value of the artificial compressibility parameter. A second-order, two-step Runge–Kutta integration coupling with an implicit residual smoothing and with a multigrid method is used for achieving fast convergence for both steady- and unsteady-state problems. The numerical results agree well with experimental and other numerical data. A comparison with an analytically exact solution is performed to verify the space and time accuracy of the algorithm.     

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 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.