MathGroup Archive 2004

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

Search the Archive

Re: Finding the Fourier transform of discrete functions

  • To: mathgroup at
  • Subject: [mg52661] Re: Finding the Fourier transform of discrete functions
  • From: "Jens-Peer Kuska" <kuska at>
  • Date: Tue, 7 Dec 2004 04:09:55 -0500 (EST)
  • Organization: Uni Leipzig
  • References: <cohi1d$1fh$> <> <comgk7$7a2$> <copa52$pmk$> <cos0k6$dgj$>
  • Sender: owner-wri-mathgroup at


f[x_Integer]]/;1<=x<=12 = Sin@x

say that for a integer x in [1,12] the function can be simplifyed to
Sin[x], it say *not* that for other arguments the function
is indeterminate. The additional definition


would do that.


"Peter Pein" <petsie at> schrieb im Newsbeitrag 
news:cos0k6$dgj$1 at
> Jens-Peer Kuska wrote:
>> Hi,
>> and you think that 1<=x<12 is discret, and not a infinite number
>> of continuous values ?? Strange !
>> Regards
>>   Jens
>> "DrBob" <drbob at> schrieb im Newsbeitrag
>> news:comgk7$7a2$1 at
>>>>>what is a "discrete function".
>>>>>if it is a function, the parameter is continuous and FourierTransform[]
>>>>>compute the transformation.
>>>A discrete function is a function with a discrete domain.
>>>For instance, this is a discrete function on the obvious domain:
>>>f[x_Integer]/;1<=x<=12 = Sin@x
>     *^^^^^^^^*
>>>It is NOT the Sin function, for the simple reason that the domain of a
>>>function (in math or mathematica) is part of its definition.
> I think, it's his firm conviction that there are only 12 Integers x in
> the interval 1<=x<=12. ;-)
> -- 
> Peter Pein
> 10245 Berlin

  • Prev by Date: Re: Partial fraction command
  • Next by Date: Re: Complex Analysis using Mathematica
  • Previous by thread: Re: Finding the Fourier transform of discrete functions
  • Next by thread: Re: again Compile