1982
DOI: 10.1190/1.1441288
|View full text |Cite
|
Sign up to set email alerts
|

Forward modeling by a Fourier method

Abstract: A Fourier or pseudospectral forward‐modeling algorithm for solving the two‐dimensional acoustic wave equation is presented. The method utilizes a spatial numerical grid to calculate spatial derivatives by the fast Fourier transform. Time derivatives which appear in the wave equation are calculated by second‐order differencing. The scheme requires fewer grid points than finite‐difference methods to achieve the same accuracy. It is therefore believed that the Fourier method will prove more efficient than finite‐… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
207
0
1

Year Published

1991
1991
2016
2016

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 479 publications
(218 citation statements)
references
References 4 publications
1
207
0
1
Order By: Relevance
“…The numerical solution is based on a Taylor expansion of this operator up to the fourth order, and the Runge-Kutta algorithm is used (Jain, 1984;Carcione, 2007). The spatial derivatives are calculated with the Fourier pseudospectral method (Kosloff and Baysal, 1982;Carcione, 2007). This method consists of a spatial discretization and calculation of spatial derivatives using the fast Fourier transform.…”
Section: Numerical Solutionmentioning
confidence: 99%
“…The numerical solution is based on a Taylor expansion of this operator up to the fourth order, and the Runge-Kutta algorithm is used (Jain, 1984;Carcione, 2007). The spatial derivatives are calculated with the Fourier pseudospectral method (Kosloff and Baysal, 1982;Carcione, 2007). This method consists of a spatial discretization and calculation of spatial derivatives using the fast Fourier transform.…”
Section: Numerical Solutionmentioning
confidence: 99%
“…Other spatial interpolations are possible. Previous discrete expressions are based on Lagrange interpolations while other interpolations are possible such as Chebychev or Laguerre polynomial or Fourier interpolations (Kosloff & Baysal, 1982;Kosloff et al, 1990;Mikhailenko et al, 2003). Interpolation basis could be local (Lagrange) or global(Fourier) ones based on equally spaced nodes or judiciously distributed nodes for keeping interpolation errors as small as possible: this will have a dramatic impact on the accuracy of the numerical estimation of the derivative and, therefore, on the resolution of partial differential equations.…”
Section: Spatial-domain Finite-difference Approximationsmentioning
confidence: 99%
“…Another approach to modeling is pseudospectral method which uses Fourier transforms and requires fewer grid points per wavelength than other numerical modeling methods such as the finite-difference and finite-element methods to achieve the same accuracy. The characteristics of pseudospectral algorithms are described by references [1,2,3]. As the required storage extremely exceeded the capacity of the central memory at that time, the algorithm called for retrieving and restoring 3-D data sets in each of time steps.…”
Section: Introductionmentioning
confidence: 99%