两种轰炸弹道快速积分算法的比较

Comparation of Two Fast Integration Algorithms for Air to Surface Attack

利用数学仿真，测试了两种轰炸弹道快速积分方法：中国湖算法和极坐标算法，后者是西北工业大学（ＮＰＵ）开发的。对某型航弹的弹道诸元解算的结果表明，无论是精度还是实时计算量，后者都优于前者甚多。

A comparative study on two fast integration algorithms for solving ballistics in air to surface fire control problems is devoted.The first one,a variable step 2nd order Runge Kutta algorithm,was commonly referred to as the China Lake algorithm 1 ,while the other,led from a polar transformation of the phase space of the exterior ballistics,was developed at the NPU recently.Their accuracy is measured by a standard ballistics calculation procedure and their computational burden is counted by calling system clock in the DOS system in the testing Intel 80486(50 MHz)based HP notebook.The test results on a typical China made conventional projectile indicate that the latter is far more accurate and faster than the former.