欢迎光临《计算力学学报》官方网站!
孙东亮,王艳宁,张奥林,宇波,李汉勇.不同网格扭曲率下压力修正全隐算法——IDEAL求解性能研究
Performance study of pressure-correction fully-implicit algorithm—IDEAL on different grid skew rates[J].计算力学学报,2017,(2):183~190
不同网格扭曲率下压力修正全隐算法——IDEAL求解性能研究
Performance study of pressure-correction fully-implicit algorithm—IDEAL on different grid skew rates
Performance study of pressure-correction fully-implicit algorithm—IDEAL on different grid skew rates
投稿时间:2016-01-09  修订日期:2016-07-09
DOI:10.7511/jslx201702009
中文关键词:  压力修正算法  IDEAL  网格扭曲率  健壮性  收敛性
英文关键词:pressure-correction algorithm  IDEAL  grid skew rate  robustness  convergence rate
基金项目:国家自然科学基金面上项目(51476054);教育部新世纪优秀人才支持计划(NCET-13-0792,BIPT-POPME-2015)资助项目
作者单位E-mail
孙东亮 北京石油化工学院 机械工程学院 北京 102617 sundongliang@bipt.edu.cn 
王艳宁 华北电力大学 可再生能源学院 北京 102206  
张奥林 北京化工大学 机电工程学院 北京 100029  
宇波 北京石油化工学院 机械工程学院 北京 102617  
李汉勇 北京石油化工学院 机械工程学院 北京 102617  
摘要点击次数: 155
全文下载次数: 168
中文摘要:
      2008年,本文作者和陶文铨等提出了一种用于速度和压力耦合求解的高效稳定压力修正全隐算法IDEAL,该算法通过在每个迭代层次上对压力方程进行两次内迭代计算,完全克服了SIMPLE算法的两个假设,充分满足了速度和压力之间的耦合,从而大大提高了计算的收敛性和健壮性。为了进一步实现IDEAL算法的推广应用,本文基于三维倾斜方腔顶盖驱动流动,研究了IDEAL算法在不同网格扭曲率下的求解特性。研究发现,在不同网格扭曲率下,IDEAL算法的健壮性和收敛性均优于SIMPLE算法,特别在高网格扭曲率情况下,IDEAL算法求解性能更加优于SIMPLE算法。在不同网格扭曲率下,IDEAL算法健壮性保持不变,几乎可以在任意速度亚松弛因子下获得收敛的解,同时IDEAL算法最短计算耗时较SIMPLE算法减少了56%~89%,验证了IDEAL算法的优越性。
英文摘要:
      In 2008, an efficient pressure-correction fully-implicit algorithm for fluid flow and heat transfer problems, called IDEAL, was proposed by the present author and Tao et al. In IDEAL algorithm there exist inner double-iterative processes for pressure equation on each iteration level, almost completely overcoming two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence and robustness. In order to further extend the IDEAL algorithm, the lid-driven flow in a 3D inclined cavity is adopted to analyse its solving performance on different grid skew rates. It can be concluded that the IDEAL algorithm is more robust and more efficient than the SIMPLE algorithm on different grid skew rates, especially for the case of highly skewed grid system. The IDEAL algorithm keeps the same degree of robustness on different grid skew rates and can converge almost at any under-relaxation factor. Compared with the SIMPLE algorithm, the shortest computation time of the IDEAL algorithm can be reduced by 56%~89%. The superiority of the IDEAL algorithm is verified based on the above analyses.
查看全文  查看/发表评论  下载PDF阅读器
关闭
您是第3366020位访问者
版权所有:《计算力学学报》编辑部
本系统由 北京勤云科技发展有限公司设计