Search Results for "fft"

FFTW++ is a C++ header class for the FFTW Fast Fourier Transform library that automates memory allocation, alignment, planning, wisdom, and communication on both serial and parallel (OpenMP/MPI) architectures. In 2D and 3D, hybrid dealiasing of convolutions substantially reduces memory usage and computation time. Wrappers for C, Python, and Fortran are included.

Curve fitting | Data analysis | Plotting | Matrix operations | FFT | Extensible framework | Multiple file formats | Programmable | Open source | Free for everyone NumeRe: Framework for Numerical Computation is a numerical framework written for Microsoft Windows(R) and released under the GNU GPL v3 for solving and visualizing mathematical and physical problems numerically. Keep simple things simple: You want to plot a sine function?

Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by...

libdspl-2.0 — opensource cross-platform digital signal processing algorithm library, written in C language. Distributed under LGPL v3 license. This allows to use this library in all applications with dynamic linking.

Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of explicit integrals (EI) that define Fourier transforms. It has been shown recently that EI methods can be more accurate than FFT methods (Courtney and Courtney, A More Accurate Fourier Transform) for scientific data analysis and that EI methods can be implemented in reasonable times with modern computing power. ...

...Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov. [1] P.Berrizbeitia B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.311 [2] OEIS: http://oeis.org/

The FFT library to "Keep It Simple, Stupid" This is the original home of kissfft. Most recent development is at https://github.com/mborgerding/kissfft Please ask questions on stackoverflow.com

A C++ Matrix/Vector Class supporting real & complex data for nearly all matrix algebra calculations. Optimized for double & std::complex<double>. Small and large matrices. Easy to use & get started. Plotting, fast inversion, FFT/IFFT, statistics, & more

Cooley Tukey Algorithm (FFT) implementation on Sony-Toshiba-IBM CELL Broadband Engine

Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).