Finite Difference Approximations.ppt

Partial Differential Equations in Geophysics Numerical methods: properties Other numerical methods What is a finite difference? What is a finite difference? The big question: Taylor Series Taylor Series Taylor Series Alternative Derivation Alternative Derivation 2nd order weights Taylor Operators Interpolation and difference weights Higher order operators Higher order operators Linear system High-order interpolation First derivative Our first FD algorithm (ac1d.m) ! Problems: Stability Problems: Dispersion Our first FD code! Snapshot Example Seismogram Dispersion Finite Differences - Summary Dispersion: The numerical approximation has artificial dispersion, in other words, the wave speed becomes frequency dependent (Derivation in the board). You have to find a frequency bandwidth where this effect is small. The solution is to use a sufficient number of grid points per wavelength. True velocity % Time stepping for i=1:nt, % FD disp(sprintf( Time step : %i,i)); for j=2:nx-1 d2p(j)=(p(j+1)-2*p(j)+p(j-1))/dx^2; % space derivative end pnew=2*p-pold+d2p*dt^2; % time extrapolation pnew(nx/2)=pnew(nx/2)+src(i)*dt^2; % add source term pold=p; % time levels p=pnew; p(1)=0; % set boundaries pressure free p(nx)=0; % Display plot(x,p,b-) title( FD ) drawnow end Conceptually the most simple of the numerical methods and can be learned quite quickly Depending on the physical problem FD methods are conditionally stable (relation between time and space increment) FD methods have difficulties concerning the accurate implementation of boundary conditions (e.g. free surfaces, absorbing boundaries) FD methods are usually explicit and therefore very easy to implement and efficient on parallel computers FD methods work best on regular, rectangular grids * Computational Seismology Finite Differences Introduction Computational Seismology Introduction Computational Seismology Introduction Computat