虚拟流体方法的显隐算法  

An Explicit-implicit Algorithm for Ghost Fluid Method

作　　者：丁岩[1] 袁礼[2] 杨莉[1] 

机构地区：[1]河南理工大学,河南焦作454000 [2]中国科学院数学与系统科学研究院计算数学所,北京100190

出　　处：《计算物理》2013年第1期27-34,共8页Chinese Journal of Computational Physics

基　　金：国家自然科学基金(11126116);河南理工大学博士基金(B2010-11)资助项目

摘　　要：基于算子分裂,把欧拉方程分裂成对流项和非对流项两部分,建立一种基于原始变量的二阶显隐算法.由通常的虚拟流体方法显式地预估流场,用隐式的压力修正对预估解进行修正.计算结果表明,这样可以有效增大时间步长,提高计算效率.Based on operator splitting technique, Euler equations is splitted into convection part and non-convection part. A predicted solution is obtained by solving the convection part with explicit GFM method. It is corrected by an implicit pressure correction algorithm derived from the non-convection part. A second order primitive explicit-implicit algorithm is built. It shows that CFL condition can be relaxed and efficiency is improved.

关 键 词：虚拟流体方法 显隐算法问题 算子分裂 

分 类 号：O351[理学—流体力学]