A Julia framework for implementing FFTs

-

An efficient sampler for discrete random variables

Designs for new Base array interface primitives, used widely through scientific machine learning (SciML) and other organizations

Bit twiddling convenience functions.

AD-backend agnostic system defining custom forward and reverse mode rules. This is the light weight core to allow you to define rules for your functions in your packages, without depending on any particular AD system.

Interface for transformation functions in Julia

-

A combinatorics library for Julia

Naïve combined subexpression elimination in Julia

Fixing the world one invalidator at a time.

Compatibility across Julia versions

Ask the CPU for cache sizes, SIMD feature support, a running hypervisor, and more.

-

A data-focused namespace for packages to share functions

Julia implementation of Data structures

Interface for mathematical/statistical densities in Julia

A package which provides an API for querying differentiation results at multiple orders simultaneously

A simple shared suite of common derivative definitions

A Julia package for evaluating distances (metrics) between vectors.

A Julia package for probability distributions and associated functions.

Extensions for Julia's docsystem.

Julia bindings to the FFTW library for fast Fourier transforms

Julia package for lazily representing matrices filled with a single entry

Forward Mode Automatic Differentiation for Julia

-

A Julia package for calculating hypergeometric functions

Under some conditions you may need this function

Interface for function inversion in Julia

Defines additional irrationals

-

Julia package for various special functions based on `log` and `exp`.

Macro(s) for vectorizing loops.

MacroTools provides a library of tools for working with Julia code and expressions.

Manual memory management utilities.

Missing value support for Julia

Julia math built-ins which return NaN and accumulator functions which ignore NaN

High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.

Fortran-like arrays with arbitrary, zero or negative starting indices.

Julia implementation of associative containers that preserve insertion order