SlideShare a Scribd company logo
1 of 3
Download to read offline
1 FOURIER TRANSFORM
Spectral solution of the 2D Homogeneous
acoustical wave equation
Author: Ing. Jhonatan Andr´es Amado Valderrama.
The concept of Fourier transform comes from the idea that a signal can be represented
as the sum of many harmonic signals of different frequencies.
1 Fourier Transform
Consider a ricker source f(t) for t < T given by:
1 def r i c k e r ( t , fq ) :
2 arg=(np . pi ∗∗2) ∗( fq ∗∗2) ∗( t ∗∗2)
3 r i c k e r =(1.0 −2.0∗ arg ) ∗np . exp(−arg )
As mentioned before, the ricker source can decompose as a sum of individual sinusoidal
waves, each with different amplitude, frequency and phases.
y (t) =
n
An sin (ωnt + φn) (1)
A Fourier transform is a simple way of finding the numbers An, ωn, φn. In general having
a set of N points, it is possible to write 1 as,
yn =
N−1
k=0
ˆyke2πikn/N
(2)
where ˆyk now contains information about the amplitude and the phase of the k-th
harmonic mode.
These are some properties of the Fourier transform if the signal is real.
1
3 WAVE EQUATION
ˆyN−k =ˆy∗
k (3)
ˆyN+k =ˆyk (4)
2 Fast Fourier Transform
The problem of calculating Fourier Transform is that this problems requires O(N2) which
becomes huge when N increase As seismic problems as FWI and RTM. There is a family of
algorithms designed to calculate Fourier coefficients in O(N log N) known as Fast Fourier
Transform Methods. An implementation can be found in python with numpy.fft.fft and
numpy.fft.ifft
3 Wave Equation
Let consider a wave in two dimensions generated at the location r0 = (x0, z0), the per-
turbation at P(x, z, t) follow the expression in 5 assumed that the source is point-like in
space
∂2P
∂x2
+
∂2P
∂z2
−
1
c2
∂2P
∂t2
= δ(x, z)S(t) (5)
Taking the Fourier transform of P(r, t) = P(x, z, t) the equation 5 can be written as
∂2 ˆP
∂x2
+
∂2 ˆP
∂z2
−
ω2
c2
ˆP = δ(r) ˆS(ω) (6)
It can be shown that if this is the case, the solution can be written as:
ˆP(r, ω) =G(r − r0, ω) ∗ ˆS(ω) (7)
G(r, ω) =
e−iωr/c
4πr
(8)
r = |r| (9)
The solution of this problem is just to calculate the Fourier transform of the signal,
multiply it by G and calculate the inverse Fourier transform.
2
4 SIMULATION
4 Simulation
The next figures represent the simulation of a ricker source at source(500, 500). Some par-
ticular propertie is that this kind of solution of the wave equation does not need boundary
condition, because with the Fourier transform all the field is known in each time in all the
homogeneous media.
(a) Field solution at t = 0.1[s]. (b) Field solution at t = 0.6[s].
(c) Field solution at t = 0.9[s].
Figure 1: Field solution at different times. Notice that in 1c
there are not reflection at the boundarys
3

More Related Content

What's hot

Brief Review of Fourier Analysis
Brief Review of Fourier AnalysisBrief Review of Fourier Analysis
Brief Review of Fourier Analysisop205
 
Eece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformEece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformSandilya Sridhara
 
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...T. E. BOGALE
 
History and Real Life Applications of Fourier Analaysis
History and Real Life Applications of Fourier AnalaysisHistory and Real Life Applications of Fourier Analaysis
History and Real Life Applications of Fourier AnalaysisSyed Ahmed Zaki
 
Signal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier TransformsSignal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier TransformsArvind Devaraj
 
Fourier transforms
Fourier transformsFourier transforms
Fourier transformskalung0313
 
Learning object 1
Learning object 1Learning object 1
Learning object 1Ina Na
 
Tele3113 wk1tue
Tele3113 wk1tueTele3113 wk1tue
Tele3113 wk1tueVin Voro
 
fourier representation of signal and systems
fourier representation of signal and systemsfourier representation of signal and systems
fourier representation of signal and systemsSugeng Widodo
 
Db31463471
Db31463471Db31463471
Db31463471IJMER
 
Tele4653 l5
Tele4653 l5Tele4653 l5
Tele4653 l5Vin Voro
 

What's hot (20)

Fourier transforms
Fourier transforms Fourier transforms
Fourier transforms
 
Brief Review of Fourier Analysis
Brief Review of Fourier AnalysisBrief Review of Fourier Analysis
Brief Review of Fourier Analysis
 
Eece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transformEece 301 note set 14 fourier transform
Eece 301 note set 14 fourier transform
 
Fourier transform
Fourier transformFourier transform
Fourier transform
 
Lecture 9
Lecture 9Lecture 9
Lecture 9
 
Fourier series
Fourier seriesFourier series
Fourier series
 
Chapter6 sampling
Chapter6 samplingChapter6 sampling
Chapter6 sampling
 
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...
USRP Implementation of Max-Min SNR Signal Energy based Spectrum Sensing Algor...
 
History and Real Life Applications of Fourier Analaysis
History and Real Life Applications of Fourier AnalaysisHistory and Real Life Applications of Fourier Analaysis
History and Real Life Applications of Fourier Analaysis
 
Fourier Transform
Fourier TransformFourier Transform
Fourier Transform
 
Signal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier TransformsSignal Processing Introduction using Fourier Transforms
Signal Processing Introduction using Fourier Transforms
 
Fourier transforms
Fourier transformsFourier transforms
Fourier transforms
 
Learning object 1
Learning object 1Learning object 1
Learning object 1
 
Tele3113 wk1tue
Tele3113 wk1tueTele3113 wk1tue
Tele3113 wk1tue
 
Fourier transform
Fourier transformFourier transform
Fourier transform
 
fourier representation of signal and systems
fourier representation of signal and systemsfourier representation of signal and systems
fourier representation of signal and systems
 
Fourier transform
Fourier transformFourier transform
Fourier transform
 
Db31463471
Db31463471Db31463471
Db31463471
 
Tele4653 l5
Tele4653 l5Tele4653 l5
Tele4653 l5
 
Siphon
SiphonSiphon
Siphon
 

Similar to spectralmethod

MLP輪読スパース8章 トレースノルム正則化
MLP輪読スパース8章 トレースノルム正則化MLP輪読スパース8章 トレースノルム正則化
MLP輪読スパース8章 トレースノルム正則化Akira Tanimoto
 
Heuristics for counterexamples to the Agrawal Conjecture
Heuristics for counterexamples to the Agrawal ConjectureHeuristics for counterexamples to the Agrawal Conjecture
Heuristics for counterexamples to the Agrawal ConjectureAmshuman Hegde
 
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoid
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoidFourier transforms & fft algorithm (paul heckbert, 1998) by tantanoid
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoidXavier Davias
 
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSION
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSIONMaster Thesis on Rotating Cryostats and FFT, DRAFT VERSION
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSIONKaarle Kulvik
 
Time Series Analysis
Time Series AnalysisTime Series Analysis
Time Series AnalysisAmit Ghosh
 
A Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleA Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleOctavianPostavaru
 
Pulse Modulation ppt
Pulse Modulation pptPulse Modulation ppt
Pulse Modulation pptsanjeev2419
 
Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...Alexander Litvinenko
 
Fourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lFourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lPepa Vidosa Serradilla
 
Ray : modeling dynamic systems
Ray : modeling dynamic systemsRay : modeling dynamic systems
Ray : modeling dynamic systemsHouw Liong The
 

Similar to spectralmethod (20)

MLP輪読スパース8章 トレースノルム正則化
MLP輪読スパース8章 トレースノルム正則化MLP輪読スパース8章 トレースノルム正則化
MLP輪読スパース8章 トレースノルム正則化
 
Kanal wireless dan propagasi
Kanal wireless dan propagasiKanal wireless dan propagasi
Kanal wireless dan propagasi
 
Fourier transform
Fourier transformFourier transform
Fourier transform
 
Ft3 new
Ft3 newFt3 new
Ft3 new
 
Heuristics for counterexamples to the Agrawal Conjecture
Heuristics for counterexamples to the Agrawal ConjectureHeuristics for counterexamples to the Agrawal Conjecture
Heuristics for counterexamples to the Agrawal Conjecture
 
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoid
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoidFourier transforms & fft algorithm (paul heckbert, 1998) by tantanoid
Fourier transforms & fft algorithm (paul heckbert, 1998) by tantanoid
 
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSION
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSIONMaster Thesis on Rotating Cryostats and FFT, DRAFT VERSION
Master Thesis on Rotating Cryostats and FFT, DRAFT VERSION
 
Time Series Analysis
Time Series AnalysisTime Series Analysis
Time Series Analysis
 
Signal & system
Signal & systemSignal & system
Signal & system
 
A Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scaleA Fibonacci-like universe expansion on time-scale
A Fibonacci-like universe expansion on time-scale
 
Pulse Modulation ppt
Pulse Modulation pptPulse Modulation ppt
Pulse Modulation ppt
 
Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...Low rank tensor approximation of probability density and characteristic funct...
Low rank tensor approximation of probability density and characteristic funct...
 
Signal Processing Homework Help
Signal Processing Homework HelpSignal Processing Homework Help
Signal Processing Homework Help
 
Fourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lFourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 l
 
Dsp Lab Record
Dsp Lab RecordDsp Lab Record
Dsp Lab Record
 
ENFPC 2010
ENFPC 2010ENFPC 2010
ENFPC 2010
 
M6.pdf
M6.pdfM6.pdf
M6.pdf
 
Linear response theory
Linear response theoryLinear response theory
Linear response theory
 
Ray : modeling dynamic systems
Ray : modeling dynamic systemsRay : modeling dynamic systems
Ray : modeling dynamic systems
 
002 ray modeling dynamic systems
002 ray modeling dynamic systems002 ray modeling dynamic systems
002 ray modeling dynamic systems
 

spectralmethod

  • 1. 1 FOURIER TRANSFORM Spectral solution of the 2D Homogeneous acoustical wave equation Author: Ing. Jhonatan Andr´es Amado Valderrama. The concept of Fourier transform comes from the idea that a signal can be represented as the sum of many harmonic signals of different frequencies. 1 Fourier Transform Consider a ricker source f(t) for t < T given by: 1 def r i c k e r ( t , fq ) : 2 arg=(np . pi ∗∗2) ∗( fq ∗∗2) ∗( t ∗∗2) 3 r i c k e r =(1.0 −2.0∗ arg ) ∗np . exp(−arg ) As mentioned before, the ricker source can decompose as a sum of individual sinusoidal waves, each with different amplitude, frequency and phases. y (t) = n An sin (ωnt + φn) (1) A Fourier transform is a simple way of finding the numbers An, ωn, φn. In general having a set of N points, it is possible to write 1 as, yn = N−1 k=0 ˆyke2πikn/N (2) where ˆyk now contains information about the amplitude and the phase of the k-th harmonic mode. These are some properties of the Fourier transform if the signal is real. 1
  • 2. 3 WAVE EQUATION ˆyN−k =ˆy∗ k (3) ˆyN+k =ˆyk (4) 2 Fast Fourier Transform The problem of calculating Fourier Transform is that this problems requires O(N2) which becomes huge when N increase As seismic problems as FWI and RTM. There is a family of algorithms designed to calculate Fourier coefficients in O(N log N) known as Fast Fourier Transform Methods. An implementation can be found in python with numpy.fft.fft and numpy.fft.ifft 3 Wave Equation Let consider a wave in two dimensions generated at the location r0 = (x0, z0), the per- turbation at P(x, z, t) follow the expression in 5 assumed that the source is point-like in space ∂2P ∂x2 + ∂2P ∂z2 − 1 c2 ∂2P ∂t2 = δ(x, z)S(t) (5) Taking the Fourier transform of P(r, t) = P(x, z, t) the equation 5 can be written as ∂2 ˆP ∂x2 + ∂2 ˆP ∂z2 − ω2 c2 ˆP = δ(r) ˆS(ω) (6) It can be shown that if this is the case, the solution can be written as: ˆP(r, ω) =G(r − r0, ω) ∗ ˆS(ω) (7) G(r, ω) = e−iωr/c 4πr (8) r = |r| (9) The solution of this problem is just to calculate the Fourier transform of the signal, multiply it by G and calculate the inverse Fourier transform. 2
  • 3. 4 SIMULATION 4 Simulation The next figures represent the simulation of a ricker source at source(500, 500). Some par- ticular propertie is that this kind of solution of the wave equation does not need boundary condition, because with the Fourier transform all the field is known in each time in all the homogeneous media. (a) Field solution at t = 0.1[s]. (b) Field solution at t = 0.6[s]. (c) Field solution at t = 0.9[s]. Figure 1: Field solution at different times. Notice that in 1c there are not reflection at the boundarys 3