MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: convolution vs. NMinimize

  • To: mathgroup at
  • Subject: [mg52445] Re: convolution vs. NMinimize
  • From: Bill Rowe <readnewsciv at>
  • Date: Sat, 27 Nov 2004 01:40:56 -0500 (EST)
  • Sender: owner-wri-mathgroup at

On 11/26/04 at 1:04 AM, lupos at (robert) wrote:

>especialy (but not only) with samplelegths which are powers of 2
>convolution can be done efficiently by FFT (Mathematica Fourier[])
>the "convolution theorem" states that to perform convolution(f,g)
>you may take the the fourier transforms F=Fourier[f] and
>G=Fourier[g] and get the convolution by calculating

>for a sample length n

>Fourier[] calculates in n*Log[n] time (because of FFT)
>ListConvolve[] calculates in n*n time

>the differnece is enormous for large n.

I am pretty sure ListConvolve makes use of the fast fourier transform. In fact, a quick check

{0.04 Second,Null}

{0.8 Second,Null}

2^20 Log[2^20]/(2^16 Log[2^16])//N

indicates the time for ListConvolve is proportional to n Log[n]
To reply via email subtract one hundred and four

  • Prev by Date: Re: Automatic numbered equations
  • Next by Date: Re: Non-algebraic solution
  • Previous by thread: Re: convolution vs. NMinimize
  • Next by thread: launching a kernel on a remote linux machine through ssh from a linux machine