MathGroup Archive 2006

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

Search the Archive

Re: finding Fourier Series.

  • To: mathgroup at smc.vnet.net
  • Subject: [mg63852] Re: finding Fourier Series.
  • From: "Steve Luttrell" <steve_usenet at _removemefirst_luttrell.org.uk>
  • Date: Thu, 19 Jan 2006 00:02:51 -0500 (EST)
  • References: <dqks93$ptf$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Use FourierTransform:

FourierTransform[a^n*UnitStep[n],n,k]

to obtain

I/(Sqrt[2*Pi]*(k - I*Log[a]))

Steve Luttrell

"bd satish" <bdsatish at gmail.com> wrote in message 
news:dqks93$ptf$1 at smc.vnet.net...
>
>   Hi buddies,
>
>        Which command (in  MATHEMATICA) should I use to evaluate the
> so-called Discrete-Time Fourier Series ?
>
>     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: Re: question about matrix
  • Next by Date: Re: Visualization site updates
  • Previous by thread: Re: finding Fourier Series.
  • Next by thread: Re: finding Fourier Series.