首页> 外文会议>AIAA 25th AIAA Fluid Dynamics Conference June 20-23, 1994/Colorado Springs, CO >An efficient multigrid acceleration for colving the 3-D incompressible navier-stokes equations in generalized curvilinear coordinates
【24h】

An efficient multigrid acceleration for colving the 3-D incompressible navier-stokes equations in generalized curvilinear coordinates

机译:在广义曲线坐标系中求解3-D不可压缩纳维斯托克斯方程的有效多网格加速

获取原文

摘要

In this paper, an efficient multigrid algorithm is presented for solving the three-dimensional incompressible Navier-Stokes equations for practical engineering problems. THe artifiial compressibility form of the equations is discretized in a finite volume form on a time-dependent curvilinear coordinate system, and the so-called Discretized Newton-Relaxation (DNR) scheme is used as the iterative procedure for the solution of the system of equations. A nonlinear multigrid scheem (FAS) is applied to accelerate te convergence of the time-dependent equations to a steady state. Two methods for constructing the coarse grid operator, the Galerkin coarse grid approximation (GCA) and the discrete coarse grid approximation (DCA), have also been investigated and incorporated into the FAS scheme. Experiments show that the Galerkin coarse grid approximation provides better performance for the multigrid scheme than the discrete coarse grid approximation.
机译:本文提出了一种有效的多重网格算法,用于解决实际工程问题中的三维不可压缩的Navier-Stokes方程。方程的人工压缩形式在时间依赖的曲线坐标系上以有限体积的形式离散,并且所谓的离散牛顿松弛(DNR)方案用作求解方程组的迭代过程。应用非线性多重网格方案(FAS)将时变方程的加速收敛到稳态。还研究了两种构造粗网格算子的方法,即Galerkin粗网格逼近(GCA)和离散粗网格逼近(DCA),并将其合并到FAS方案中。实验表明,与离散粗糙网格逼近相比,Galerkin粗糙网格逼近为多网格方案提供了更好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号