Is there any conventional approach to calculate the following integral:
a (x,y) = int [ A (u,v) * H (x,y,u,v) * exp [ i (x*u + y*v) ] dudv]
The part A(u,v)*exp[ i (x*u + y*v)] represents a conventional FFT. But I also have a set of functions Hx,y(u,v) which have their own distributions in u,v - plane.
One direct way is to perform N calculations substituting Hi,j function one by another. The question is if there is some general FFT approach optimizing the calculus by reducing the number of calls?
Dear Uche,
Of course this is an integral of discrete functions. And of course it can be represented by a number of summations. There are different approaches, which depend on the exact type of the function Hx,y(u,v). The question was how to get use of the FFT algorithm to reduce the number of calls, and NOT breaking it into individual summations.
- Badges
- Science topic
- Similar topics
- Applied Mathematics
- Calculations