| 一种线性走时插值射线追踪改进算法 |
| |
| 引用本文： | 卢江波,方志.一种线性走时插值射线追踪改进算法[J].地震学报,2014,36(6):1089-1100. |
| |
| 作者姓名： | 卢江波 方志 |
| |
| 作者单位： | 中国长沙 410082 湖南大学土木工程学院 |
| |
| 基金项目： | 国家自然科学基金(51278182，51408213)资助． |
| |
| 摘 要： | 针对线性走时插值算法(LTI)不能正确追踪逆向传播射线的问题， 目前已提出多种改进算法， 如扩张收缩LTI算法、 循环计算LTI算法、 动态网络最短路径射线追踪算法等， 但这些算法的计算效率普遍偏低. 在分析各种改进LTI算法的优劣后， 本文提出了改进动态网络最短路径射线追踪算法. 该改进算法依据波的传播规律以及LTI算法的基本方程， 排除动态网络最短路径射线追踪算法中大量冗余节点计算, 并采用传统的二叉树堆排序算法对波前阵列节点进行管理. 数值算例表明， 本文提出的改进算法具有较高的计算效率， 其计算效率是动态网络最短路径射线追踪算法的4.5—30倍， 是原始LTI算法的2—6.5倍； 当动态网络最短路径射线追踪算法采用堆排序算法时， 改进算法的计算效率是其3.5—15倍.
|
| 关 键 词： | 射线追踪 线性走时插值 改进算法 波前扩展 计算效率 |
| 收稿时间： | 2013-12-27 |
An improved ray-tracing algorithm based on linear travel-time interpolation |
| |
| Lu Jiangbo,Fang Zhi.An improved ray-tracing algorithm based on linear travel-time interpolation[J].Acta Seismologica Sinica,2014,36(6):1089-1100. |
| |
| Authors: | Lu Jiangbo Fang Zhi |
| |
| Affiliation: | College of Civil Engineering, Hunan University, Changsha 410082, China |
| |
| Abstract: | In order to solver for the problem that the original LTI algorithm could not trace the reverse propagation ray, several linear travel-time interpolation (LTI for short) improved algorithms, such as extension-compaction LTI algorithm, loop computation LTI algorithm, the shortest path ray tracing algorithm with dynamic networks, have been presented, but the computational efficiency 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 wavefront array. The numerical examples show that, the improved algorithm presented in this paper has the highest computational efficiency among all of improved algorithms; its calculation efficiency is about 4.5—30 times of the shortest 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. |
| |
| Keywords: | ray tracing linear traveltime interpolation improved algorithm wavefront expansion computational efficiency |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《地震学报》浏览原始摘要信息 |
|
点击此处可从《地震学报》下载全文 |
|
