Search Results for "fourier transform fortran code"
Sort By:
Showing 6 open source projects for "fourier transform fortran code"
View related business solutions-
Email is the backbone of your customer engagement. The Twilio SendGrid Email API is the email service trusted by developers and marketers for time-savings, scalability, and delivery expertise. Our flexible Email API and proprietary Mail Transfer Agent (MTA), intuitive console, powerful features, and email experts make it easy to ensure all your email gets delivered in seconds and without interruption.
-
KrakenD is a high-performance API Gateway optimized for resource efficiency, capable of managing 70,000 requests per second on a single instance. The stateless architecture allows for straightforward, linear scalability, eliminating the need for complex coordination or database maintenance.
-
1
libdspl-2.0
libdspl-2.0 is opensource cross-platform digital signal processing alg
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. -
2
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.
-
3
FFTW_Ada
An Ada 2012 binding to the FFTW fast Fourier transform library
FFTW_Ada is an Ada binding to the FFTW (fast Fourier transform) library written at MIT by Matteo Frigo and Steven G. Johnson. FFTW is written in C. FFTW_Ada allows calls to FFTW from an Ada program, thus allowing Ada code to compute fast Fourier and certain other related transforms. FFTW_Ada v2 works with FFTW v3 and requires Ada 2012. -
4
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.) AAFFT, implemented by Mark Iwen in 2008. This code is easy to use, and documented well, but not implemented very... -
For minor company expenses, you might utilize a spend management solution or track everything in spreadsheets. For everything more, you'll need Precoro. We help companies achieve procurement excellence and budget efficiency by building transparent, predictable, automated spending workflows.
-
5
disp2sif
Stress intensity factor (SIF) calculation from crack tip displacements
The code implements Muskhelishvili's complex function approach to calculate 2D stress intensity factors (modes I+II) from crack tip displacement fields. Surface displacements can be used with a plane stress elastic model. The code uses power/Fourier series expansion and a conformal mapping of an ellipse onto a circle. -
6
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)
- Previous
- You're on page 1
- Next