3 programs for "fourier transform fortran code" with 2 filters applied:

  • Better time tracking for projects, billing, and payroll Icon
    Better time tracking for projects, billing, and payroll

    Journyx makes it easy to gather accurate time and expense data so you can make smarter, more informed business decisions.

    This product is especially great for project managers, COOs, finance professionals, accountants, or payroll admins in any industry.
  • Business Continuity Solutions | ConnectWise BCDR Icon
    Business Continuity Solutions | ConnectWise BCDR

    Build a foundation for data security and disaster recovery to fit your clients’ needs no matter the budget.

    Whether natural disaster, cyberattack, or plain-old human error, data can disappear in the blink of an eye. ConnectWise BCDR (formerly Recover) delivers reliable and secure backup and disaster recovery backed by powerful automation and a 24/7 NOC to get your clients back to work in minutes, not days.
  • 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