中文摘要：

本文提出了一种求解流动与传热问题的高效稳定的分离式算法-IDEAL（Inner Doubly-iterative Efficient Algorithm for Linked—equations）。在IDEAL算法中每个迭代层次上对压力方程进行两次内迭代计算，第一次内迭代过程用于克服SIMPLE算法的第一个假设，第二次内迭代过程用于克服SIMPLE算法的第二个假设。这样在每个迭代层次上充分满足了速度和压力之间的耦合，从而大大提高了计算的收敛速度和计算过程的稳定性。本文通过2个三维不可压缩流动和传热的算例对IDEAL算法与其它三个被广泛使用的算法（SIMPLER、SIMPLEC和PISO）进行了比较。通过分析比较得出IDEAL算法在收敛性和健壮性上均优于SIMPLER、SIMPLEC和PISO算法。在这2个算例中IDEAL算法几乎可以在任意的松弛因子下获得收敛的解，并且IDEAL算法所需最短计算时间较SIMPLER算法减少12．9％～52．6％；较SIMPLEC算法减少48．3％～N79．1％；较PISO算法减少10．7％～46．5％。

英文摘要：

Recently an efficient segregated solution procedure for incompressible fluid flow and heat transfer problems, called IDEAL （Inner Doubly-iterative Efficient Algorithm for Linked-equations）, has been proposed by author. In the algorithm there exist inner doubly-iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. In the present paper the property of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed by the comparison between the algorithm and three most widely-used algorithms （SIMPLER, SIMPLEC and PISO）. By the comparison for two application examples we can find that the IDEAL algorithm, which can converge almost at any under-relaxation factor, is far more robust than SIMPLER, SIMPLEC and PISO algorithms. When each method uses its own optimal under-relaxation factor, the IDEAL algorithm can reduce the computation time by 12.9%～52.6% over SIMPLER algorithm, by 48.3%～79.1% over SIMPLEC algorithm and bv 10.7%～46.5% over PlSO algorithm