Hilbert transform of gravity gradient profiles: Special cases of the general gravity‐gradient tensor in the Fourier transform domain

Geophysics ◽  
2002 ◽  
Vol 67 (3) ◽  
pp. 766-769 ◽  
Author(s):  
Juan Homero Hinojosa ◽  
Kevin L. Mickus
Keyword(s):  
Fourier Transform ◽  
Hilbert Transform ◽  
Gravity Gradient ◽  
Transform Domain ◽  
Gradient Tensor ◽  
Gravity Gradient Tensor ◽  
Special Cases ◽  
The Fourier Transform ◽  
Fourier Transform Domain

scholarly journals Wave splitting for first-order systems of equations

2002 ◽  
Vol 32 (6) ◽  
pp. 371-381 ◽  
Author(s):  
G. Caviglia ◽  
A. Morro
Keyword(s):  
Fourier Transform ◽  
Partial Differential Equations ◽  
Time Domain ◽  
Space Variable ◽  
Transform Domain ◽  
Systems Of Equations ◽  
First Order ◽  
Wave Splitting ◽  
The Fourier Transform ◽  
Fourier Transform Domain

Systems of first-order partial differential equations are considered and the possible decomposition of the solutions in forward and backward propagating is investigated. After a review of a customary procedure in the space-time domain (wave splitting), attention is addressed to systems in the Fourier-transform domain, thus considering frequency-dependent functions of the space variable. The characterization is given for the direction of propagation and applications are developed to some cases of physical interest.

Seismic trace interpolation in the Fourier transform domain

Geophysics ◽  
2003 ◽  
Vol 68 (1) ◽  
pp. 355-369 ◽  
Author(s):  
Necati Gülünay
Keyword(s):  
Fourier Transform ◽  
Fourier Transforms ◽  
Interpolation Method ◽  
Original Data ◽  
Transform Domain ◽  
3D Data ◽  
Adaptive Interpolation ◽  
Data Adaptive ◽  
The Fourier Transform ◽  
Fourier Transform Domain

A data adaptive interpolation method is designed and applied in the Fourier transform domain (f‐k or f‐kx‐ky for spatially aliased data. The method makes use of fast Fourier transforms and their cyclic properties, thereby offering a significant cost advantage over other techniques that interpolate aliased data. The algorithm designs and applies interpolation operators in the f‐k (or f‐kx‐ky domain to fill zero traces inserted in the data in the t‐x (or t‐x‐y) domain at locations where interpolated traces are needed. The interpolation operator is designed by manipulating the lower frequency components of the stretched transforms of the original data. This operator is derived assuming that it is the same operator that fills periodically zeroed traces of the original data but at the lower frequencies, and corresponds to the f‐k (or f‐kx‐ky domain version of the well‐known f‐x (or f‐x‐y) domain trace interpolators. The method is applicable to 2D and 3D data recorded sparsely in a horizontal plane. The most common prestack applications of the algorithm are common‐mid‐point domain shot interpolation, source‐receiver domain shot interpolation, and cable interpolation.

scholarly journals The N-Dimensional Uncertainty Principle for the Free Metaplectic Transformation

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1685
Author(s):  
Rui Jing ◽  
Bei Liu ◽  
Rui Li ◽  
Rui Liu
Keyword(s):  
Fourier Transform ◽  
Quantum Mechanics ◽  
Uncertainty Principle ◽  
Transformation Operator ◽  
Local Analysis ◽  
Transform Domain ◽  
Uncertainty Principles ◽  
The Fourier Transform ◽  
Heisenberg's Uncertainty Principle ◽  
Fourier Transform Domain

The free metaplectic transformation is an N-dimensional linear canonical transformation. This transformation operator is useful, especially for signal processing applications. In this paper, in order to characterize simultaneously local analysis of a function (or signal) and its free metaplectic transformation, we extend some different uncertainty principles (UP) from quantum mechanics including Classical Heisenberg’s uncertainty principle, Nazarov’s UP, Donoho and Stark’s UP, Hardy’s UP, Beurling’s UP, Logarithmic UP, and Entropic UP, which have already been well studied in the Fourier transform domain.

Sign in / Sign up

Export Citation Format

Share Document