[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

GAMS Module FFT in C++


FFT

 
C++ procedures for computing forward and reverse (fast) discrete Fourier
transforms of a real or complex sequence having length a power of two. (Developed
by Oleg Kiselyov.).
 
Classes  :  J1a1 . One-dimensional real fast Fourier transforms
            J1a2 . One-dimensional complex fast Fourier transforms
 
Type     : C++ software in C++ collection.
Access   : Public domain. Portable.
Precision: Double.
Note     : Fullsource is a Unix shell archive. Also see 
           http://pobox.com/~oleg/ftp/ 
 
See also : LIN_ALG, SERV_CC
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of FFT from C++ on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Double.
Note     : Fullsource is a Unix shell archive. Also see 
           http://pobox.com/~oleg/ftp/ 
 
You may access components from NETLIB outside GAMS as follows.
 
   Fullsource   : Anonymous FTP from ftp.netlib.org in c++/fft.tgz


[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology

This page was generated on Wed Sep 17, 2008 at 18:06:02 UTC