Search Results for "fourier transform fortran code"

3 programs for "fourier transform fortran code" with 1 filter applied:

  • Passwordless authentication enables a secure and frictionless experience for your users | Auth0 Icon
    Over two-thirds of people reuse passwords across sites, resulting in an increasingly insecure e-commerce ecosystem. Learn how passwordless can not only mitigate these issues but make the authentication experience delightful. Implement Auth0 in any application in just five minutes
  • Employee monitoring software with screenshots Icon
    Employee monitoring software with screenshots

    Clear visibility and insights into how employees work. Even remotely

    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

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    disp2sif

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    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)
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next