Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Fourier transform

  1. Jul 25, 2010 #1
    Suppose a function f(k) has a power series expansion:

    [tex]f(k)=\Sigma a_i k^i [/tex]

    Is it possible to inverse Fourier transform any such function?

    For example:

    [tex]f(k)=\Sigma a_i k^{i+2}\frac{1}{k^2} [/tex]

    Since g(k)=1/k^2 should have a well-defined inverse Fourier transform, and the inverse Fourier transform of k*g(k) -> dg(x)/dx [where g(x) is the inverse Fourier transform of g(k)], then inverse Fourier transform of f(k) is an infinite sum of the inverse Fourier transforms of g(k)=1/k^2 and its derivatives d^n[g(x)]/dx^n.
     
  2. jcsd
  3. Aug 2, 2010 #2
    Woah there. If you want to talk about the fourier transforms (inverse or otherwise) of polynomials, etc, you'll have to move into distribution theory and all that that entails. In the process, you'll lose the ability to simply multiply "functions" and your second equation will raise hairs all over the place when you come to apply it.

    As to your first question, if I remember correctly, the "answer" to your question exists only in the realm of distributions. Specifically, I think your power series has the inverse fourier transform
    [tex]
    F(x)= \sum_n (-i)^n a_n \delta^n (x)
    [/tex]

    Where [tex]\delta^n(x)[/tex] is the n^th derivative of the Dirac delta function. It's OK to write these as a function so long as you remember that they can never be evaluated; only integrated.

    I'll finish by warning you to never, ever divide or multiply any dirac functions by other such. It's not a defined operation.
     
  4. Aug 8, 2010 #3
    As long as your function is square summable (or square integrable) you can always take the Fourier inverse.
    Vignon S. Oussa
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Fourier transform
  1. Fourier transforms (Replies: 2)

  2. Fourier transformation (Replies: 0)

  3. Fourier transform (Replies: 2)

  4. Fourier transforms (Replies: 1)

  5. Fourier transform (Replies: 1)

Loading...