3‐D network ray tracing

Abstract

An efficient algorithm of the network shortest path calculation of rays and traveltimes of the first arrivals is described. The traveltime error of such computations is estimated. The rough estimate of the relative traveltime error is evaluated locally at all network nodes prior to network ray tracing, and is minimized by means of a proper choice of the sizes of forward stars. In this way, the structure of the network is adjusted for a particular model and for a particular computer memory. After network ray tracing, the error estimate is refined and the absolute error bounds of the calculated traveltimes are evaluated. The method and its accuracy are demonstrated on numerical examples. Copyright © 1994, Wiley Blackwell. All rights reserved