首页> 外文会议>AIAA computational fluid dynamics conference >Implicit lower-upper/approximate-factorization algorithms for viscous incompressible flows
【24h】

Implicit lower-upper/approximate-factorization algorithms for viscous incompressible flows

机译:粘性不可压缩流的隐式上下/近似分解算法

获取原文

摘要

A Lower-Upper/Approximate-Factorization (LU/AF) scheme is developed for the incompressible Navier-Stokes equations. The LU/AF scheme is to be used in conjunction with linearized implicit approximations and artificial compressibility to compute steady solutions, and within sub-iterations to compute unsteady solutions. The LU/AF scheme contains an iteration parameter that can be adjusted to improve iterative convergence rate. For one choice of the parameter (alpha = 1) this scheme is equivalent to symmetric Gauss-Seidel relaxation; for another choice (alpha = 0), the factorization is an LU analog of that used in ADI schemes. Optimal convergence behavior is found to occur at an intermediate value of the parameter.
机译:针对不可压缩的Navier-Stokes方程,开发了一种下-上/近似因子化(LU / AF)方案。 LU / AF方案将与线性化隐式近似和人工可压缩性结合使用,以计算稳定解,并在子迭代内计算非稳定解。 LU / AF方案包含一个迭代参数,可以对其进行调整以提高迭代收敛速度。对于参数(alpha = 1)的一种选择,此方案等效于对称高斯-塞德尔松弛。对于另一个选择(alpha = 0),因式分解是ADI方案中使用的LU模拟。发现最佳收敛行为发生在参数的中间值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号