Minimum travel time tree algorithm for seismic ray tracing: Improvement in efficiency

65Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The computational efficiency of the basic minimum travel time tree (MTTT) algorithm for seismic ray tracing is improved by means of dynamically adjusting the pre-defined propagation area of secondary waves according to the spread of seismic waves. The improvement on the MTTT algorithm is achieved explicitly by limiting the calculation of seismic rays and travel times to a small pre-defined propagation area of secondary waves and to the secondary waves from the points around the straight elongation of the incoming ray. Numerical examples verify that a good approximation of travel times and ray paths can be obtained with the improved algorithm using a small pre-defined propagation area of secondary waves even for complex models. Furthermore, the denser a grid coverage a model has, the greater the improvement in computational efficiency the new algorithm makes. The computational efficiency is more obvious for a 3D model than for a 2D one. © 2004 Nanjing Institute of Geophysical Prospecting.

Cite

CITATION STYLE

APA

Zhao, A., Zhang, Z., & Teng, J. (2004). Minimum travel time tree algorithm for seismic ray tracing: Improvement in efficiency. Journal of Geophysics and Engineering, 1(4), 245–251. https://doi.org/10.1088/1742-2132/1/4/001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free