Nonlinear one‐dimensional seismic waveform inversion using simulated annealing

Geophysics ◽  
1991 ◽  
Vol 56 (10) ◽  
pp. 1624-1638 ◽  
Author(s):  
Mrinal K. Sen ◽  
Paul L. Stoffa

The seismic inverse problem involves finding a model m that either minimizes the error energy between the data and theoretical seismograms or maximizes the cross‐correlation between the synthetics and the observations. We are, however, faced with two problems: (1) the model space is very large, typically of the order of [Formula: see text]; and, (2) the error energy function is multimodal. Existing calculus‐based methods are local in scope and easily get trapped in local minima of the energy function. Other methods such as “simulated annealing” and “genetic algorithms” can be applied to such global optimization problems and they do not depend on the starting model. Both of these methods bear analogy to natural systems and are robust in nature. For example, simulated annealing is the analog to a physical process in which a solid in a “heat bath” is heated by increasing the temperature, followed by slow cooling until it reaches the global minimum energy state where it forms a crystal. To use simulated annealing efficiently for 1-D seismic waveform inversion, we require a modeling method that rapidly performs the forward modeling calculation and a cooling schedule that will enable us to find the global minimum of the energy function rapidly. With the advent of vector computers, the reflectivity method has proved successful and the time of the calculation can be reduced substantially if only plane‐wave seismograms are required. Thus, the principal problem with simulated annealing is to find the critical temperature, i.e., the temperature at which crystallization occurs. By initiating the simulated annealing process with different starting temperatures for a fixed number of iterations with a very slow cooling, we noticed that by starting very near but just above the critical temperature, we reach very close to the global minimum energy state very rapidly. We have applied this technique successfully to band‐limited synthetic data in the presence of random noise. In most cases we find that we are able to obtain very good solutions using only a few plane wave seismograms.

1994 ◽  
Vol 03 (04) ◽  
pp. 477-495 ◽  
Author(s):  
Terry J. Ligocki ◽  
James A. Sethian

This paper describes the development and implementation of an algorithm which uses simulated annealing to recognize knots by minimizing an energy function defined over all knots. A knot is represented by a piecewise linear curve and the vertices of this curve are perturbed using simulated annealing to minimize the energy. Moving one line segment through another line segment is prohibited. The resulting minimum energy configuration is defined to be the canonical form. The algorithm is then tested with two different types of energy over a collection of complex knots.


2001 ◽  
Vol 12 (02) ◽  
pp. 293-305 ◽  
Author(s):  
HÜSEYIN OYMAK ◽  
ŞAKIR ERKOÇ

We have investigated the minimum-energy distribution of N, 3 ≤ N ≤ 97, equal point charges confined to the surface of a sphere. Charges interact with each other via the Coulomb potential of the form 1/r. Minimum-energy distributions have been determined by minimizing the tangential forces on each charge. Further numerical evidence shows that in the minimum-energy state of N charges on the sphere, it is not possible to place a charge at the geometrical center. Besides, it has been found that the most and reliable information about the relative stability properties of the distributions can be obtained with the help of second difference energy consideration.


Geophysics ◽  
1995 ◽  
Vol 60 (5) ◽  
pp. 1457-1473 ◽  
Author(s):  
Carey Bunks ◽  
Fatimetou M. Saleck ◽  
S. Zaleski ◽  
G. Chavent

Iterative inversion methods have been unsuccessful at inverting seismic data obtained from complicated earth models (e.g. the Marmousi model), the primary difficulty being the presence of numerous local minima in the objective function. The presence of local minima at all scales in the seismic inversion problem prevent iterative methods of inversion from attaining a reasonable degree of convergence to the neighborhood of the global minimum. The multigrid method is a technique that improves the performance of iterative inversion by decomposing the problem by scale. At long scales there are fewer local minima and those that remain are further apart from each other. Thus, at long scales iterative methods can get closer to the neighborhood of the global minimum. We apply the multigrid method to a subsampled, low‐frequency version of the Marmousi data set. Although issues of source estimation, source bandwidth, and noise are not treated, results show that iterative inversion methods perform much better when employed with a decomposition by scale. Furthermore, the method greatly reduces the computational burden of the inversion that will be of importance for 3-D extensions to the method.


Sign in / Sign up

Export Citation Format

Share Document