Rapid convergence of some seismic processing algorithms

Publisher Website
Google Scholar
Abstract
The rate of convergence of many numerical algorithms can be greatly improved by repeated application of the method of summation by parts. Cases of interest in seismology arise when we need to resample the spectrum of a function at unevenly spaced frequency values. Related examples include the time‐domain evaluation of the Hilbert transform and the extrapolation to the real axis of spectra evaluated in the complex domain. A formula of this type was first presented by Lanczos (1956). The validity of the algorithms depends upon the fact that summation by parts of the cardinal‐series representation is justified as long as a function is somewhat oversampled.

This publication has 0 references indexed in Scilit: