Search Results for "fft"

* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:...

Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++

math lib for .NET. n-dim arrays, complex numbers, linear algebra, FFT, sorting, cells- and logical arrays as well as 3D plotting classes help developing algorithms on every platform supporting .NET. Sources from SVN, binaries: http://ilnumerics.net

...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/

A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.

JTransforms is the first, open source, multithreaded FFT library written in pure Java. Benchmark results show better performance than FFTW. The latest version is available at http://github.com/wendykierp/JTransforms.

GENIAL is a C++ library for signal and image processing. It uses template-generic techniques, multi threading, cache optimization and SIMD instructions for Pentium (MMX, SSE, SSE2, SSE3) to achieve high performance: FFT,DCT,Convolution,Linear Algebra...

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

ObjC framework for mathematical operations. Various DSP (inc. FFT + wavelet), statistical operations and more on vector and array types. Optimized for SIMD and multi-threading where possible.

Port of Numerical Python to Jython (Java Python) to support all mathematical operations (linear algebra, matrices, DSP, wavelets, FFT, arrays...) and thus compete with commercial packages such as Matlab. It can be easily embedded in Java programs.

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).