MathGroup Archive 1998

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

Search the Archive

Re: Fourier transform


Hi Jens-Peer

> Fourier[] implements a numerical fast fourier transform. That means that
> the data passed to Fourier[] are  the function values f(t) on the
> interval t in [0,2Pi) with constant increment. The data are assumed to
> be periodic in t with period 2Pi.

 My understanding was that Fourier implemented a Discrete Fourier
Transform as a general case, and a Fast Fourier Transform if your data
length an integer power of 2.

--
 ==================================================================
 David Annetts                                       _____________
 http://www.ocs.mq.edu.au/~dannetts/                |C R C A M E T|
                                                    |-------------|
                                                    |_____        |
 CRC for Australian Mineral                         |````` \      |
 Exploration Technologies                           |`````/$\     |
 Earth Sciences                                     |````/$$$\____|
 Macquarie University, NSW 2109                     |```/$$$/.....|
 AUSTRALIA                                          |``/$$$/......|
 phone: +(1-61-2) 9850 9280, fax (1-61-2) 9850 8366  -------------
 ==================================================================



  • Prev by Date: Mathematica Access to Files
  • Next by Date: Re: NDSolve
  • Previous by thread: Re: Fourier transform
  • Next by thread: Re: Re: Fourier transform