Search Results for "fourier transform fortran code"
Sort By:
Showing 13 open source projects for "fourier transform fortran code"
View related business solutions-
From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
-
Our computer monitoring software allows employees, field contractors, and freelancers to manually clock in when they begin working on an assignment. The application will take screenshots randomly or at set intervals, which allows employers to observe the work process. The application only tracks activity when the employee is clocked in. No spying, only transparency.
-
1
DataFrame
C++ DataFrame for statistical, Financial, and ML analysis
... of analytical algorithms in the form of visitors. These are from basic stats such as Mean, and Std Deviation and return, … to more involved analysis such as Affinity Propagation, Polynomial Fit, and Fast Fourier transform of arbitrary length … including a good collection of trading indicators. You can also easily add your own algorithms. -
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
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. -
HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
5
DarkF
DarkF is an FFT optical simulation code for GW inteferometers
... (larger than a mirror) and a sampling rate of 256*256). With the Fourier transform method, it is easy to obtain a propagated beam and we can use this code to simulate a simple or a complex system as a Fabry Perot cavity or Advanced detector, like Advanced Virgo, Advanced LIGO or Kagra. It can include reflection and transmission maps from measurements or real mirrors. -
6
This is a recursive C++ source code of the Fast Fourier Transform algorithm allowing parallelization. Also a performance test and its results on my computer are provided. The Performance test suggest to use 4 threads for parallelization. With this one can beat the implementation in "Numerical Recipes in C++" for large signals with more than 2^16 / 2^17 / 2^18 samples depending on the hardware and software.
-
7
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... -
8
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. -
9
This is an Image Processing toolkit written in Java. The source code is intended to help you understand processes such as Color Inversion, Edge Detection, Fourier Transform, Morphological process, Laplacian Sharpening, Gaussian Noise Adding, and hist
-
Chat with your business data with Looker. More than just a modern business intelligence platform, you can turn to Looker for self-service or governed BI, build your own custom applications with trusted metrics, or even bring Looker modeling to your existing BI environment.
-
10
FFTL
Templated Fast Fourier Transform in C++
Now moved to GitHub: https://github.com/CoreyShay/FFTL Provides some relatively easier to use than normal templated FFT classes written in C++. This is currently still a work in progress, but the FFT portion (complex and real) both output the correct results, and the code executes very quickly, around only 30% or so slower than the much more difficult to compile FFTW on SSE enabled platforms. Though optimized code only runs on SSE (x86) based platforms, it's a very simple matter to port... -
11
kernel_smoother
Binned Kernel Density Estimate via FFTW
The library implements multivariate kernel density estimates via fast fourier transform from http://www.fftw.org/ The main code is used for constructing jet templates for computing data-driven jet substructure estimate for QCD backgrounds. -
12
Fast Matrix for Java
General purpose matrix utilities for Java in Parallel Computing
Fast Matrix for Java (fm4j) is a general-purpose matrix utility library for computing with dense matrices. fm4j encapsulated different underlying implementations and select the optimal one in run-time depending on the size of the input matrix. Moreover, fm4j employs Java (Tm) Concurrency to take advantage of the computation power of multi-cor processors. -
13
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