MathGroup Archive 2004

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

Search the Archive

Re: Reassembling Fourier Transforms

  • To: mathgroup at
  • Subject: [mg48868] Re: Reassembling Fourier Transforms
  • From: Bill Rowe <readnewsciv at>
  • Date: Sun, 20 Jun 2004 02:39:20 -0400 (EDT)
  • Sender: owner-wri-mathgroup at

On 6/19/04 at 4:31 AM, lfis at (Lee Fisher) wrote:

>I am trying to turn a list of points into a function, and one of
>the ways I thought to do this was to use Fourier to find the
>frequency components of the list, and then to Create a sum of
>exponentials as follows:

<code snipped>

>I have two questions concerning this.  First, is there an easier
>way to turn a set of random values into a function so that NDSolve
>can move through the function and always find the same value at a
>given point (i.e. c[6] will always equal .6002)? 

Yes, there is an easier way. Use Interpolation. For example




To reply via email subtract one hundred and four

  • Prev by Date: Re: Mathematica can't do this double integral
  • Next by Date: Re: Writing/appending tables to CSV files?
  • Previous by thread: RE: Reassembling Fourier Transforms
  • Next by thread: Re: Reassembling Fourier Transforms