MathGroup Archive 2006

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

Search the Archive

Re: finding Fourier Series.

  • To: mathgroup at smc.vnet.net
  • Subject: [mg63888] Re: finding Fourier Series.
  • From: pdesai1 at umbc.edu
  • Date: Sat, 21 Jan 2006 01:50:36 -0500 (EST)
  • References: <200601180739.CAA26311@smc.vnet.net><dqqbie$lr3$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

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

Hmm.. Is'nt that something like the Z-Transform??
> 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: NDSolve and vector variables
  • Next by Date: Re: Weiner process
  • Previous by thread: Re: finding Fourier Series.
  • Next by thread: Re: finding Fourier Series.