A fast algorithm for two-point ray tracing

Abstract

A new approximate algorithm for two-point ray tracing is proposed and tested in a variety of laterally heterogeneous velocity models. An initial path estimate is perturbed using a geometric interpretation of the ray equations, and the travel time along the path is minimized in a piecewise fashion. This perturbation is iteratively performed until the travel time converges within a specified limit. Test results show that this algorithm successfully finds the correct travel time within typical observational error much faster than existing three-dimensional ray tracing programs. The method finds an accurate ray path in a fully three-dimensional form even where lateral variations in velocity are severe. Because our algorithm utilizes direct minimization of the travel time instead of solving the ray equations, a simple linear interpolation scheme can be employed to compute velocity as a function of position, providing an added computational advantage.