• Keine Ergebnisse gefunden

∫∫ −=⎟⎟⎠⎞⎜⎜⎝⎛∂=∂ )()()( dkekikFdkekFxf Computational seismology – Pseudospectral methods

N/A
N/A
Protected

Academic year: 2021

Aktie "∫∫ −=⎟⎟⎠⎞⎜⎜⎝⎛∂=∂ )()()( dkekikFdkekFxf Computational seismology – Pseudospectral methods"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Computational seismology – Pseudospectral methods

1. Numerical methods are often compared in terms of memory required and floating point operations needed per time step. How do you think does a standard finite difference method compare to a pseudospectral method?

2. The first derivative of a function in the spectral domain is ik

=

⎟⎟⎠

⎜⎜⎝

∂ ⎛

=

dk e k ikF

dk e k F x

f

ikx ikx x

x

) (

) ( )

(

What are the operators for the 2nd (3rd etc) derivatives. How would one in principle calculate the corresponding (convolutional) operators in the space domain?

3. Why does the numerical solution for Green’s functions lead to unusable results (without postprocessing). Why – however – is it very useful to calculate impulse responses in many cases. Any applications?

4. Do pseudospectral methods suffer from numerical anisotropy?

Referenzen

ÄHNLICHE DOKUMENTE

However, the space derivatives are calculated using orthogonal functions (e.g. Fourier Integrals, Chebyshev polynomials).. They are either evaluated using matrix-

• Several Pioneers of solving PDEs with finite-difference method (Lewis Fry Richardson, Richard Southwell, Richard Courant, Kurt Friedrichs, Hans Lewy, Peter Lax and John von

• As the space discetization is often imposed by considering the smallest seismic velocities in the medium and the highest frequencies, the CFL criterion determines the time

• By mixing finite-difference operators and pseudospectral operators in the different spatial directions, the method was used for interesting seismological problems (Furumura et

• Because of the grid densification at the boundaries of the Chebyshev collocation points very small time steps are required for stable simulations when n is large. This can be

In general, the numerical solution of boundary value problems is more difficult than that of initial value problems because the relatively simple approaches of propagating a solution

MIPS - Floating Point Instructions. Floating Point Operations are done

It should be stressed that the results are not restricted to lattice Boltzmann methods but can readily be applied to any other finite difference scheme (see [4] for various examples