A dynamical storage-deletion algorithm of database for reducing computational cost is proposed to solve the stiff chemical reaction source term with time-consuming by direct integration. The algorithm is examined in computations of one-dimensional and two-dimensional gaseous detonations, respectively. Computational results show that the algorithm can not only satisfy the requirements of computational accuracy, but also relax the stringent limitation of the computer memory occupancy. For the one-dimensional detonation, the speedup factor of the computations using dynamical storage-deletion algorithm increases with the enlargement of the database size, and the maximum speedup factor approaches six. For the two-dimensional detonation induced by shock wave focusing, the speedup factor is 2.54 when the table size is no more than 1 000 MB. The algorithm proposed here shows good generalization and advantage in applications of transient reacting flow simulations.%针对反应流中刚性化学反应源项直接积分计算量大的问题,提出了减少计算时间的动态数据库存储/删除算法.分别在一维爆轰和二维爆轰计算中对算法进行了检验.计算结果表明,该算法既可以很好地满足计算精度要求,又减少了对计算机的内存占用.对于一维爆轰波传播,计算的加速比随数据库容量的增加而增加,其最大加速比接近6;对于二维激波聚集诱导的爆轰,数据库容量不超过1 000 MB时,计算的加速比为2.54.该文算法在处理瞬态反应流问题时具有通用性和优越性.
展开▼
