Search Results for "s-transform"

SLEEF stands for SIMD Library for Evaluating Elementary Functions. SLEEF implements vectorized versions of all C99 math functions, that utilize SIMD instructions of modern processors to make computation more efficient. The library also includes vectorized DFT subroutines.

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.

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.

smib is one of the smallest and simplest computer algebra system in the world, but simple does not mean simplistic. Using smib you can explore many branches of mathematics (e.g. number theory, algebra, calculus, numerical analysis, differential geometry, probability and stochastic calculus) and also some physics (e.g. electromagnetism and quantum mechanics).. By simple you can understand easy to program (smib is a dynamically typed language, with strong affinity to recursivity, programs...

CUDALucas is a program implementing the Lucas-Lehmer primality test for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3 up to CUDA 6.5, 2.x up to 7.0 and 3.x for >=CUDA 8.0 . The program is run from the command line, however it can be configured without using a terminal. See the Wiki for more details. README for new users available at the Files/Downloads page.

The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and Finite Radon Transform (FRT). Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance.

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

libdwt is a cross-platform discrete wavelet transform library implemented in C language. The library implements fast wavelet transform algorithm using lifting scheme. Cohen-Daubechies-Feauveau wavelets with 4 vanishing moments were used.

Command line / filter tool - Analyze, compute and transform numerical data tables of unlimited length

A library for fast computation of Gauss transforms in multiple dimensions, using the Improved Fast Gauss Transform and Approximate Nearest Neighbor searching. This library is useful for efficient Kernel Density Estimation (KDE) using a Gaussian kernel.

Continuous wavelet transform library

Fast Gauss Transform Implementation Evaluate the sum of N Gaussians at M points

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)

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