Determination of subsurface heterogeneity using reflection seismic data

1999 ◽  
Author(s):  
Matthias G. Imhof
Keyword(s):  
Seismic Data ◽  
Reflection Seismic ◽  
Subsurface Heterogeneity

Generalized form of the Dix equation for the calculation of interval velocities and layer thicknesses

Geophysics ◽  
1989 ◽  
Vol 54 (5) ◽  
pp. 659-661 ◽  
Author(s):  
Ali A. Nowroozi
Keyword(s):  
Root Mean Square ◽  
Seismic Data ◽  
Approximate Equation ◽  
Mean Square ◽  
Interval Velocity ◽  
Reflection Seismic ◽  
Interval Velocities ◽  
Horizontal Layers

Over three decades ago, Dix (1955) derived an approximate equation for the determination of interval velocity from observed reflection seismic data. Assuming a stack of m horizontal layers, with interval velocities [Formula: see text], layer thicknesses [Formula: see text], j = 1, m, and near‐vertical raypaths, Dix (1955) showed that [Formula: see text]where [Formula: see text] and [Formula: see text] are the two‐way vertical times and [Formula: see text] and [Formula: see text] are the root‐mean‐square (rms) velocities to interfaces j + 1 and j, respectively.

THE DETERMINATION OF DIGITAL WIENER FILTERS BY MEANS OF GRADIENT METHODS

Geophysics ◽  
1973 ◽  
Vol 38 (2) ◽  
pp. 310-326 ◽  
Author(s):  
R. J. Wang ◽  
S. Treitel
Keyword(s):  
Seismic Data ◽  
High Speed ◽  
Gradient Methods ◽  
Wiener Filter ◽  
Gradient Algorithm ◽  
Rapid Convergence ◽  
True Solution ◽  
Peripheral Device ◽  
Wiener Filters

The normal equations for the discrete Wiener filter are conventionally solved with Levinson’s algorithm. The resultant solutions are exact except for numerical roundoff. In many instances, approximate rather than exact solutions satisfy seismologists’ requirements. The so‐called “gradient” or “steepest descent” iteration techniques can be used to produce approximate filters at computing speeds significantly higher than those achievable with Levinson’s method. Moreover, gradient schemes are well suited for implementation on a digital computer provided with a floating‐point array processor (i.e., a high‐speed peripheral device designed to carry out a specific set of multiply‐and‐add operations). Levinson’s method (1947) cannot be programmed efficiently for such special‐purpose hardware, and this consideration renders the use of gradient schemes even more attractive. It is, of course, advisable to utilize a gradient algorithm which generally provides rapid convergence to the true solution. The “conjugate‐gradient” method of Hestenes (1956) is one of a family of algorithms having this property. Experimental calculations performed with real seismic data indicate that adequate filter approximations are obtainable at a fraction of the computer cost required for use of Levinson’s algorithm.

Preliminary determination of crustal structure in the Katmai National Monument, Alaska

1967 ◽  
Vol 57 (6) ◽  
pp. 1367-1392
Author(s):  
Eduard Berg ◽  
Susumu Kubota ◽  
Jurgen Kienle
Keyword(s):  
Crustal Structure ◽  
Seismic Data ◽  
Bouguer Anomaly ◽  
Volcanic Area ◽  
Average Depth ◽  
S Wave ◽  
Contour Map ◽  
Alaska Peninsula ◽  
National Monument

Abstract Seismic and gravity observations were carried out in the active volcanic area of Katmai in the summer of 1965. A determination of hypocenters has been aftempted using S and P arrivals at a station located at Kodiak and two stations located in the Monument. However, in most cases, deviations of travel times from the Jeffreys-Bullen tables were rather large. Therefore hypocenters are not well located. A method based on P- and S-wave arrivals yields a Poisson's ratio of 0.3 for the upper part of the mantle under Katmai. This higher value is probably due to the magma formation. The average depth to the Moho from seismic data in the same area is 38 km and 32 km under Kodiak. Using Woollard's relation between Bouguer anomaly and depth to the Moho, a small mountain root under the volcanoes with a depth of 34 km was found dipping gently up to 31 km on the NW side. The active volcanic cones are located along an uplift block. This block is associated with a 35 mgal Bouguer anomaly. The Bouguer anomaly contour map for the Alaska Peninsula is given and an interpretation attempted.

THREE‐DIMENSIONAL SEISMIC METHOD

Geophysics ◽  
1972 ◽  
Vol 37 (3) ◽  
pp. 417-430 ◽  
Author(s):  
G. G. Walton
Keyword(s):  
Seismic Data ◽  
Average Velocity ◽  
Three Dimensional ◽  
Data Gathering ◽  
Seismic Method ◽  
Dynamic Display ◽  
Profile Line ◽  
Production Problems ◽  
Dense Coverage

The three‐dimensional seismic method is a different way of gathering and presenting seismic data. Instead of showing the subsurface beneath a profile line, 3-D displays give an, areal picture from the shallowest reflector to the deepest one that can be found seismically. Data are collected in the field with cross‐spreads that provide over 2000 evenly spaced depth points on each reflecting interface. Several variations of the cross‐spread technique give the same subsurface coverage while providing flexibility in data gathering. Because of the dense coverage, the method is best suited for problems requiring great detail, such as production problems. The usual presentation of 3-D data is a visual, moving display of emerging wavefronts covering four sq mi of surface. From this dynamic display, average velocity to each reflector and the dip direction and magnitude can be computed. The method has proved especially useful for the recognition of faults and determination of fault directions.

Sign in / Sign up

Export Citation Format

Share Document