CAJ | 학술논문

针对线性走时插值算法（LTI）不能正确追踪逆向传播射线的问题，目前已提出多种改进算法，如扩张收缩 LTI 算法、循环计算 LTI 算法、动态网络最短路径射线追踪算法等，但这些算法的计算效率普遍偏低．在分析各种改进 LTI 算法的优劣后，本文提出了改进动态网络最短路径射线追踪算法．该改进算法依据波的传播规律以及 LTI 算法的基本方程，排除动态网络最短路径射线追踪算法中大量冗余节点计算，并采用传统的二叉树堆排序算法对波前阵列节点进行管理．数值算例表明，本文提出的改进算法具有较高的计算效率，其计算效率是动态网络最短路径射线追踪算法的4．5—30倍，是原始 LTI 算法的2—6．5倍；当动态网络最短路径射线追踪算法采用堆排序算法时，改进算法的计算效率是其3．5—15倍．
침대선성주시삽치산법（LTI）불능정학추종역향전파사선적문제，목전이제출다충개진산법，여확장수축 LTI 산법、순배계산 LTI 산법、동태망락최단로경사선추종산법등，단저사산법적계산효솔보편편저．재분석각충개진 LTI 산법적우렬후，본문제출료개진동태망락최단로경사선추종산법．해개진산법의거파적전파규률이급 LTI 산법적기본방정，배제동태망락최단로경사선추종산법중대량용여절점계산，병채용전통적이차수퇴배서산법대파전진렬절점진행관리．수치산례표명，본문제출적개진산법구유교고적계산효솔，기계산효솔시동태망락최단로경사선추종산법적4．5—30배，시원시 LTI 산법적2—6．5배；당동태망락최단로경사선추종산법채용퇴배서산법시，개진산법적계산효솔시기3．5—15배．
In order to solver for the problem that the original LTI algorithm could not trace the reverse propagation ray,several linear travel-time interpola-tion (LTI for short)improved algorithms,such as extension-compaction LTI algorithm,loop computation LTI algorithm,the shortest path ray tracing algo-rithm with dynamic networks,have been presented,but the computational effi-ciency of these algorithms are low.After analyzing these improved algorithms, this paper presented a new improved shortest path ray tracing algorithm with dynamic networks.According to the law of wave propagation and the basic equation of LTI,a large number of redundancy node calculation are excluded, and the traditional binary heap sort algorithm was used to manage node of wave-front array.The numerical examples show that,the improved algorithm pres-ented in this paper has the highest computational efficiency among all of im-proved algorithms;its calculation efficiency is about 4.5—30 times of the shor-test path ray tracing algorithm with dynamic networks,and about 2—6.5 times of the original LTI algorithm,and about 3.5—15 times of the shortest path ray tracing algorithm with dynamic networks when the traditional binary heap sort algorithm is also used.