Double definite integral (Fourier transform)

Click For Summary
SUMMARY

This discussion focuses on evaluating the backward Fourier integral to obtain the function f(x,y) from F(ω_x, ω_y). The user seeks Fortran code for numerical evaluation of the Fourier integral and inquires about determining the location of simple poles in the upper half-plane when dealing with a polynomial in the denominator. Recommended tools for Fast Fourier Transform (FFT) include FFTW, GSL, and Ooura, with Ooura noted for its user-friendly implementation in Fortran.

PREREQUISITES
  • Understanding of Fourier transforms and their applications
  • Familiarity with numerical integration techniques
  • Knowledge of Fortran programming for implementing FFT algorithms
  • Basic concepts of complex analysis, particularly regarding poles and residues
NEXT STEPS
  • Research the implementation of FFTW for efficient Fourier transform calculations
  • Explore GSL's FFT routines for numerical analysis
  • Study the Ooura FFT library and its Fortran implementation
  • Learn about complex analysis techniques for identifying poles in integrals
USEFUL FOR

Mathematicians, physicists, and engineers involved in signal processing, numerical analysis, or computational physics who require efficient methods for evaluating Fourier transforms and integrals.

secret2
Messages
37
Reaction score
0
I don't know if this question should be posted here, but I'll give it a shot anyways.

I am trying to find f(x,y), which can be obtain by doing the backward Fourier integral to F(\omega_x, \omega_y). I have 2 questions.

1. Is there any Fortran code that could evaluate the (numerical) Fourier integral?

2. Since the function f(x,y) is 2-dimensional, we have to do a double integral. Suppose that we evaluate first the x-integral. I have a polynimial in the denominator, but the roots of the polynomial will be functions of y. Then, how can I tell if the (simple) poles are in the upper half plane or not?
 
Technology news on Phys.org

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
1
Views
3K