首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
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.  相似文献   

2.
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.  相似文献   

3.
A local mode Fourier analysis is used to assess the suitability of the SIMPLE pressure-correction algorithm to act as a smoother in a multigrid method. The necessary ellipticity of the Navier-Stokes equations and their discrete representation are established. The theoretical analysis is compared with practical results.  相似文献   

4.
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.  相似文献   

5.
基于贴体网格的VOF方法数模流场研究   总被引:1,自引:0,他引:1  
提出了一种基于VOF方法的模拟具有复杂边界形状结构物附近流场的新算法,BFC—SIMPLE—VOF算法。采用坐标变换方法实现了任意复杂区域的结构化网格划分,在贴体网格下对二维不可压缩粘性流体的控制方程进行了离散。提出了基于交错网格的修正SIMPLE算法来迭代求解压力一速度场,修正了贴体坐标下的界面跟踪方法(VOF方法)...  相似文献   

6.
基于非结构化同位网格的SIMPLE算法   总被引:4,自引:1,他引:4  
通过基于非结构化网格的有限体积法对二维稳态Navier—Stokes方程进行了数值求解。其中对流项采用延迟修正的二阶格式进行离散;扩散项的离散采用二阶中心差分格式;对于压力-速度耦合利用SIMPLE算法进行处理;计算节点的布置采用同位网格技术,界面流速通过动量插值确定。本文对方腔驱动流、倾斜腔驱动流和圆柱外部绕流问题进行了计算,讨论了非结构化同位网格有限体积法在实现SIMPLE算法时,迭代次数与欠松弛系数的关系、不同网格情况的收敛性、同结构化网格的对比以及流场尾迹结构。通过和以往结果比较可知,本文的方法是准确和可信的。  相似文献   

7.
In this paper an unstructured multigrid algorithm is used as an iterative solution procedure for the discrete equations arising from an implicit time discretization of the unsteady Euler equations on tetrahedral grids. To calculate unsteady flows due to oscillating boundaries, a novel grid movement algorithm is introduced in which an elliptic equation with a non‒linear diffusion coefficient is used to define the displacement of interior grid nodes. This allows large grid displacements to be calculated in a single step. The multigrid technique uses an edge‒collapsing algorithm to generate a sequence of grids, and a pseudo‒time‒stepping smoother. On the coarser grids, no grid motion is used. Instead, surface normals are rotated consistently and transfer/interpolation weights are based on the time‒averaged grid co‒ordinates. A 2D NACA0012 test case is used to validate the programme. 3D results are presented for the M6 wing and a full aircraft configuration. © 1997 John Wiley & Sons, Ltd.  相似文献   

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

9.
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 L2 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.  相似文献   

10.
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.  相似文献   

11.
The behaviour of the pressure correction method is studied for the solution of the incompressible steady-state Navier-Stokes and continuity equations in a rotating cylindrical-polar co-ordinate system, the specific problem being that of laminar source-sink flow between two corotating discs. Modifications to improve the linearization and the handling of the rotation terms are introduced, and we compare three extended pressure correction schemes and also the use of a multigrid algorithm in part of the calculation procedure as a linear solver.  相似文献   

12.
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.  相似文献   

13.
The development of a multigrid solution algorithm for the computation of three-dimensional laminar fully-elliptic incompressible flows is presented. The procedure utilizes a non-orthogonal collocated arrangement of the primitive variables in generalized curvilinear co-ordinates. The momentum and continuity equations are solved in a decoupled manner and a pressure-correction equation is used to update the pressures such that the fluxes at the cell faces satisfy local mass continuity. The convergence of the numerical solution is accelerated by the use of a Full Approximation Storage (FAS) multigrid technique. Numerical computations of the laminar flow in a 90° strongly curved pipe are performed for several finite-volume grids and Reynolds numbers to demonstrate the efficiency of the present numerical scheme. The rates of convergence, computational times, and multigrid performance indicators are reported for each case. Despite the additional computational overhead required in the restriction and prolongation phases of the multigrid cycling, the superior convergence of the present algorithm is shown to result in significantly reduced overall CPU times.  相似文献   

14.
The discretization of the incompressible Navier-Stokes equation on boundary-fitted curvilinear grids is considered. The discretization is based on a staggered grid arrangement and the Navier-;Stokes equations in tensor formulation including Christoffel symbols. It is shown that discretization accuracy is much enhanced by choosing the velocity variables in a special way. The time-dependent equations are solved by a pressure-correction method in combination with a GMRES method. Special attention is paid to the discretization of several types of boundary conditions. It is shown that fairly non-smooth grids may be used using our approach.  相似文献   

15.
The ISNaS-project aims at providing tools for computer aided design and engineering in aerodynamics and hydrodynamics by developing an Information System for the simulation of complex flows based on the Navier-Stokes equations. Major components of the project are the development of a method-shell and of accurate as well as robust solvers for both compressible and incompressible flows. For the incompressible case, guided by typical applications in the field of river and coastal hydrodynamics, a solution procedure is being developed that is capable of handling complicated geometries, including free surface effects, in particular for high-Reynolds number flow regimes. In the present paper the invariant discretization of the incompressible Navier-Stokes equations in general boundary-fitted coordinate systems is discussed. It is found to be important that certain rules are followed concerning the choice of unknowns and the approximation of the geometric quantities. This is illustrated by some preliminary results. Extensions to moving coordinate systems and time-varying computational grids are indicated.  相似文献   

16.
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.  相似文献   

17.
Thedifferentialquadraturemethod(DQM)proposedbyR.Bellman[1,2]hasbeensuccessfullyemployedinnumericalcomputationsofproblemsinengineeringandphysicalscience.BecausetheinformationonallgridpointsisusedtofitthederivativesatgridpointsintheDQM,itisenoughtoobta…  相似文献   

18.
We compare the performance of different pressure correction algorithms used as basic solvers in a multigrid method for the solution of the incompressible Navier–Stokes equations on non-staggered grids. Numerical tests were performed on several cases of lid-driven cavity flow using four different pressure correction schemes, including the traditional SIMPLE and SIMPLEC methods as well as novel variants, and varying combinations of underrelaxation parameters. The results show that three of the four algorithms tested are robust smoothers for the multigrid solver and that one of the new methods converges fastest in most of the tests. © 1997 John Wiley & Sons, Ltd.  相似文献   

19.
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.  相似文献   

20.
Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time‐independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi–Babuska condition. The kl model is used to complete the turbulence closure problem. The non‐symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a ‘V‐cycling’ schedule. These methods are all compared to the non‐symmetric frontal solver. Copyright © 1999 John Wiley & Sons, Ltd.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号