Results 1 to 1 of 1

Thread: FAST Fourier Transform (FFT) Algorithm

  1. #1
    Nov 2011

    FAST Fourier Transform (FFT) Algorithm

    hey i try to solve a task, but i dont get it

    Compute the coefficient repr. of (p(x)) by using FFT algorithm.
    p(x) = 2x^3 - x + 4x + 1

    this is the way i wanted to started(i dont know if I am right)

    i have a input with length N = 4 its Array a [2, -1, 4, 1]
    then i split them in odd and even
    d[0] = FFT([-1,1])
    d[1] = FFT([2, 4])

    i dont know how to proceed further, every help would be appreciated
    Last edited by suslik; Nov 13th 2012 at 01:53 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 2
    Last Post: Aug 10th 2012, 07:41 AM
  2. Fast Fourier Transform
    Posted in the Differential Geometry Forum
    Replies: 0
    Last Post: Oct 4th 2011, 08:19 PM
  3. Laplace transform and Fourier transform what is the different?
    Posted in the Advanced Applied Math Forum
    Replies: 8
    Last Post: Dec 29th 2010, 10:51 PM
  4. Fast algorithm for calculating permutations
    Posted in the Statistics Forum
    Replies: 1
    Last Post: Dec 1st 2010, 08:13 PM
  5. Replies: 0
    Last Post: Apr 23rd 2009, 05:44 AM

Search Tags

/mathhelpforum @mathhelpforum