Compute the nth negaFibonacci number.
-
Updated
May 29, 2024 - Python
Compute the nth negaFibonacci number.
A C++17 Compile Time <cmath> Library
Rust Scientific Libary. ODE and DAE (Runge-Kutta) solvers. Special functions (Bessel, Elliptic, Beta, Gamma, Erf). Linear algebra. Sparse solvers (MUMPS, UMFPACK). Probability distributions. Tensor calculus.
Evaluate the double factorial.
the Renaissance Repository, a collection of pedagogical codes associated with the forthcoming texts Renaissance Robotics and Numerical Renaissance, by Thomas Bewley
Python library for arbitrary-precision floating-point arithmetic
Special functions with hardware acceleration
A modern Fortran statistical library.
Glaisher-Kinkelin constant.
A C++ compile-time math library using generalized constant expressions
These are the math routines from Burkhardt - slightly repackaged for convenience.
Evaluate the natural logarithm of the factorial function.
Evaluate a factorial.
Compute the binomial coefficient.
Evaluate Binet's formula extended to real numbers.
Compute the natural logarithm of the binomial coefficient.
Create an iterator which evaluates the natural logarithm of the factorial function for each iterated value.
Add a description, image, and links to the special-functions topic page so that developers can more easily learn about it.
To associate your repository with the special-functions topic, visit your repo's landing page and select "manage topics."