Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site proper.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!harpo!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!hplabs!hpda!fortune!amd70!dual!proper!chris
From: chris@proper.UUCP
Newsgroups: net.math
Subject: Re: FFT help wanted.
Message-ID: <1205@proper.UUCP>
Date: Wed, 9-May-84 21:04:57 EDT
Article-I.D.: proper.1205
Posted: Wed May  9 21:04:57 1984
Date-Received: Sat, 12-May-84 12:54:30 EDT
References: <2457@allegra.UUCP>, <775@houxz.UUCP>
Organization: Proper UNIX, San Leandro, CA
Lines: 18

<>
Hi, I am relatively new to the net, and I am wondering
if anybody could help me.
 
I need a simple algorithm to calculate a Fourier series
to approximate high-degree polynomials. I am a bit
unclear on this technique, I assume it goes:
  
 
n(1)*sin(x)+n(2)*sin(x)....
 
  
Any help would be appreciated.
 
 
Chris Hayes

{ucbvax!dual}!proper!chris