A 3D Ray Tracing Approach
A 3D Ray Tracing Approach
Minimize TXX r
s
Xr
2 n 1
li
dl
v( x, y, z ) i 2 vi
Xs
l2
dl is the differential
1
Minimize || Tobs T (v ) ||22
l vu 2
l 2j
l5j
l3j
l 4j
2 n 1
l ij
T j (v )
i 2 v i
H. Jacob (1970)
Ivansson (1983)
1. Given
2. If || P( x
x0 n
, 0
g k ) xk || 0
3. Compute
, stop
and set
f ( xk j ) g kT d k
0 j min{k , M 1}
, then
k , xk 1 xk k d k , yk g k 1 g k , sk xk 1 xk
5.
l xu
and M 0
d k P ( xk k g k ) xk
4. If f ( xk 1 ) max
f (x)
Min
s. t.
go to step 5
skT sk
k 1 T
sk y k
n
Where: P is the projection on {x / l x u} and
g k f ( xk )
2.
3.
The step size k is not the classical choice for the steepest
descent method. It speeds up the convergence of the PSG
method.
4.
5.
6.
5 layer synthetic model where P-S converted waves velocities are considered
2.
3.
Convergence to the
global minimum is
obtained.
5 layer synthetic model where P-S converted wave velocities are considered
2.
Lateral heterogeneous
model :
v( x, y ) ax by c,
a (0,1.7,1.5,1.3,0.8,0.8,1.3,1.5,1.7)T ,
b (0,1,1,1,1,1,1,1,1)T ,
c (0,800,700,500,150,150,500,700,800)T
3.
4.
,
vi li ((v z , j ) i ) 2 ((v[ x , z ], j ) i ) 2 ((v[ x , y ], j ) i ) 2
xi' xi cos( i ) cos(i ) yi sin(i ) cos( i ) zi sin(i ),
yi' xi sin( i ) yi cos(i ),
zi' xi sin( i ) cos(i ) yi sin(i ) sin(i ) zi cos(i ),
Where i
(v z , p )i 1500 100 * i m / s,
(v[ x , z ], p ) i 1200 50 * i m / s,
(v[ x , y ], p ) i 1350 80 * i m / s,
(v z , s ) i 1400 100 * (n 3 i ) m / s,
(v[ x , z ], s ) i 1000 50 * (n 3 i ) m / s,
(v[ y , z ], s ) i 1150 80 * (n 3 i ) m / s
for i=2,...,n+1
We used a (20x20)
grid size to measure
Real velocities
Initial velocities
The initial velocities have an error of 50% from the real velocities
The quality of the solution by the 2 methods are almost the same
SIRT has low computational cost per iteration but requires too many
iterations and therefore consumes more CPU time.
2.
PSG, PR+ and CONMIN reach quickly a good precision (10e-03) when
compared to SIRT and Gauss Newton methods.
3.
Gauss Newton is fast, in CPU time, for very small size of the grid.
4.
The PSG and PR+ methods outperform CONMIN for very large
problems.
5.
The PSG method is always slightly faster , in CPU time, than PR+.