首页> 外文会议>AIAA computational fluid dynamics conference;AIAA aviation forum >Comparison of Pressure-Based Runge-Kutta Schemes for Unsteady Incompressible Flows
【24h】

Comparison of Pressure-Based Runge-Kutta Schemes for Unsteady Incompressible Flows

机译:非定常不可压流基于压力的Runge-Kutta方案的比较

获取原文

摘要

A new line of pressure-based algorithms using implicit Runge-Kutta schemes are developed and compared with an explicit Runge-Kutta based SIMPLER algorithm and the traditional Crank-Nicolson based SIMPLER algorithm for unsteady incompressible flows. This paper establishes that once the pressure field is obtained, the velocity field can be solved by using various versions of the Runge-Kutta time integration method. The new algorithms are shown to accurately simulate both steady and unsteady flow problems. Metrics such as maximum possible time step and unsteady characteristics of the candidate problems are compared. For an unsteady simulation of normal flow on a flat plate, the explicit Runge-Kutta based algorithm is nine times faster than the conventional SIMPLER algorithm, while the implicit Runge-Kutta methods are up to 24 times faster.
机译:开发了使用隐含Runge-Kutta方案的基于压力的新系列算法,并将其与基于显式Runge-Kutta的SIMPLER算法和基于Crank-Nicolson的传统SIMPLER算法进行了非稳态不可压缩流的比较。本文确定一旦获得了压力场,就可以使用各种版本的Runge-Kutta时间积分方法来求解速度场。展示了新算法可以精确模拟稳态和非稳态流动问题。比较了诸如最大可能时间步长和候选问题的不稳定特征之类的度量。对于平板上正常流动的不稳定模拟,基于显式Runge-Kutta的算法比常规SIMPLER算法快9倍,而隐式Runge-Kutta方法则快24倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号