MathGroup Archive 2006

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

Search the Archive

Re: finding Fourier Series.

  • To: mathgroup at smc.vnet.net
  • Subject: [mg63875] Re: [mg63837] finding Fourier Series.
  • From: "Carl K. Woll" <carlw at wolfram.com>
  • Date: Fri, 20 Jan 2006 04:32:29 -0500 (EST)
  • References: <200601180739.CAA26311@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

bd satish wrote:
>    Hi buddies,
> 
>         Which command (in  MATHEMATICA) should I use to evaluate the
> so-called Discrete-Time Fourier Series ?
> 

Perhaps the functions in the standard package Calculus`FourierTransform` 
may help?

Carl Woll
Wolfram Research

>      Another bug: ---
> 
> 
>     The command  FOURIER[ { list } ]   finds the FFT (Fast Fourier
> Transform) of a list.   How can I evaluate  FFT symbolically (instead of a
> numerical list ) ?
> 
>     Specifically ,
> 
>          find the FFT of    a^n * UnitStep[n]    , n belongs to integer
> and   Abs[a] < 1
> 


  • Prev by Date: Weiner process
  • Next by Date: Fontsize and scaling of graphic objects
  • Previous by thread: finding Fourier Series.
  • Next by thread: Re: finding Fourier Series.