Actions for Computational aspects of Gaussian beam migration [electronic resource].

Email RIS file
Bookmark
Report an Issue

Computational aspects of Gaussian beam migration [electronic resource].

Published
Washington, D.C. : United States. Dept. of Energy, 1992.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
Physical Description
Pages: (16 pages) : digital, PDF file
Additional Creators
Colorado School of Mines, United States. Department of Energy, and United States. Department of Energy. Office of Scientific and Technical Information
Access Online

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Free-to-read Unrestricted online access
Summary
The computational efficiency of Gaussian beam migration depends on the solution of two problems: (1) computation of complex-valued beam times and amplitudes in Cartesian (x,z) coordinates, and (2) limiting computations to only those (x,z) coordinates within a region where beam amplitudes are significant. The first problem can be reduced to a particular instance of a class of closest-point problems in computational geometry, for which efficient solutions, such as the Delaunay triangulation, are well known. Delaunay triangulation of sampled points along a ray enables the efficient location of that point on the raypath that is closest to any point (x,z) at which beam times and amplitudes are required. Although Delaunay triangulation provides an efficient solution to this closest point problem, a simpler solution, also presented in this paper, may be sufficient and more easily extended for use in 3-D Gaussian beam migration. The second problem is easily solved by decomposing the subsurface image into a coarse grid of square cells. Within each cell, simple and efficient loops over (x,z) coordinates may be used. Because the region in which beam amplitudes are significant may be difficult to represent with simple loops over (x,z) coordinates, I use recursion to move from cell to cell, until entire region defined by the beam has been covered. Benchmark tests of a computer program implementing these solutions suggest that the cost of Gaussian hewn migration is comparable to that of migration via explicit depth extrapolation in the frequency-space domain. For the data sizes and computer programs tested here, the explicit method was faster. However, as data size was increased, the computation time for Gaussian beam migration grew more slowly than that for the explicit method.
Report Numbers
E 1.99:doe/er/14079-17
E 1.99: cwp--127
cwp--127
doe/er/14079-17
Subject(s)
Other Subject(s)
Note
Published through SciTech Connect.
01/01/1992.
"doe/er/14079-17"
" cwp--127"
"DE92018641"
Hale, D.
Funding Information
FG02-89ER14079
View MARC record | catkey: 14114822