CAMPLE一种求解不可压流动的协调算法

发布时间：2018-06-14 23:02

本文选题：协调算法 + SIMPLER算法　；参考：《工程热物理学报》2016年06期

【摘要】：本文提出了一种两次求解质量守恒方程、速度与压力协调的求解不可压缩流体流动与传热问题的算法。它采用与SIMPLER求解压力相似的方式,将不含亚松弛因子的离散动量方程转化为假拟速度与压力差的函数,代入到离散质量守恒方程中得到压力方程,以解决压力没有控制方程的问题。通过两次计算假拟速度和求解质量守恒方程,获得同时满足质量守恒与动量守恒的速度和压力,克服了以往的SIMPLE类算法中每一迭代步中速度和压力均不满足动量方程的缺点。有限几个算例表明,新算法的速度松弛因子对收敛速度的影响远小于SIMPLER算法,在松弛因子接近于1时,收敛速度略低于SIMPLER算法,但松弛因子低于0.8时,收敛时间与迭代次数则远小于SIMPLER,算法。
[Abstract]:This paper presents an algorithm for solving the incompressible fluid flow and heat transfer problem by solving the mass conservation equation with the coordination of velocity and pressure. The discrete momentum equation without subrelaxation factor is transformed into a function of pseudo-velocity and pressure difference, and the pressure equation is obtained in the discrete mass conservation equation. To solve the problem that pressure has no governing equation. By calculating the pseudo velocity twice and solving the mass conservation equation, the velocity and pressure satisfying both mass conservation and momentum conservation are obtained, which overcomes the shortcoming that the velocity and pressure in every iteration of simple algorithm are not satisfied with momentum equation. A limited number of examples show that the effect of the new algorithm on the convergence rate is much smaller than that of the simple algorithm. When the relaxation factor is close to 1, the convergence rate is slightly lower than that of the simple algorithm, but the relaxation factor is less than 0.8. The convergence time and iteration times are much less than simple algorithm.
【作者单位】：中国石油大学储运与建筑工程学院;中国石化胜利油田分公司胜利发电厂;
【基金】：国家自然科学基金项目(No.51276199) 国家科技重大专项(No.2011ZX05017-004-HZ01)
【分类号】：TK124

【相似文献】