Search Results for "fourier transform fortran code"
Sort By:
Showing 19 open source projects for "fourier transform fortran code"
View related business solutions-
Nasdaq Boardvantage helps directors, committees, and leadership teams be better prepared, engaged, and aligned in their collaboration and decision-making processes. Plus, our board portal makes it easier than ever for corporate secretaries and administrators to manage meetings, build agendas, and distribute materials
-
TeleRay transfers patient studies faster and more securely than any other method.
-
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
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. -
3
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.
-
4
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
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. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of... -
Designed for document-heavy industries, Pdftools’ suite of SDKs and APIs are here to make your document workflows easier, faster, and stress-free. Built on SDKs and APIs, the Pdftools products integrate seamlessly into your existing (or new) systems and applications. Process thousands of documents every minute. Our tools are precision-engineered to be efficient and run at blazing speeds. We’re engineers at heart, so we’re only satisfied with the most reliable, orderly, and usable, and well-documented platforms. Shrink file sizes down, but keep the quality and interactivity. Your documents will always be compliant for long-term archiving. We’ve obsessed over every detail in our products, and documented everything so it’s easy to get started.
-
5
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. -
6
rx2fits
HF/VHF spectrosopy code for the rx888mk2 direct-sampling receiver
rx2fits is an SDR code for the rx888mk2 direct-sampling receiver that streams spectral data with frequency up to 65 MHz to FITS files. This code is for the direct-sampling input of the receiver, which transmits real samples over USB3 at up to 130 MHz sample rate. rx2fits processes these samples to spectral intensities via a Fourier-transform poly-phase filter bank, which provides spectral resolution approaching the spectral bin width with good stop-band and adjacent-channel rejection. Sample... -
7
SpectralWorks
View, manipulate, analyze (LS fit, SVD, FT), and make figs of, spectra
Program for viewing, editing, manipulating, and analyzing absorbance spectra. Simple arithnetic includes making linear combinatins of up to 10 spectra. Advanced functions include fitting spectra as LC of standard basis spectra, singular value decomposition, Fourier transform, differentiation, integration, global fitting of 3D titration and kinetic data. Graphics features allow composing Figures and export to postscript files which can be converted to pdf, imported into photoshop... -
8
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. -
9
... are often short and powerful and maybe useful for teaching), and also easy to modify (source code is free, written in C language, and based on notions of stacks and lists). In this version : - some bugs corrected - new examples in smib-0.48/documentation/application/eigenmath/ those examples are here : eigenmath.org (with explanations), they are just adapted to smib. smib roots are here : http://www.eigenmath.org/ You may also like Davide Della Casa's work : http://algebrite.org
-
Localize is a no-code translation solution for SaaS companies, allowing you to easily translate your web app, UI, website, docs, and more.
-
10
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.
-
11
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... -
12
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. -
13
OCaml interface to FFTW3 -- the Fastest Fourier Transform in the West! (http://www.fftw.org/). The code is developed at https://github.com/Chris00/fftw-ocaml
-
14
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
-
15
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... -
16
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. -
17
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. -
18
paraffin
Iterative and recursive parallelism generics for Ada 2005 and Ada 2012
A suite of Ada 2012 generics to facilitate iterative and recursive parallelism for multicore systems and provide safer recursion for single and multicore systems. Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees -
19
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