Unlike default EcmaScript (JavaScript) constructors such as `String() defaults to '' | Number() defaults to 0 | Symbol() defaults to Symbol() | Boolean() defaults to false` . Instead, using `typed-getters` we can maintain consistency among JavaScript prim
Shared SvelteKit `+server.ts` handler wrapper (try/catch + uniform error mapping) for the atlas monorepo.
constant factorisation for machine-size integers
Deprecated in favour of `primal`. A library to generate, identify and handle prime numbers and related properties. This library includes slow enumeration of primes up to a bound, slow factorisation of arbitrary numbers, fast primality tests and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
Bayesian estimation library. Kalman filter, Informatiom, Square root, Information root, Unscented and UD filters. Numerically and dimensionally generic implementation using nalgebra. Provides fast numerically stable estimation solutions.
A lightweight native rust linear algebra library.
LDL factorisation for quasi-definite linear systems
Pure Rust Energy Systems Simulation & Optimization Library
`primal` puts raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
High-order screened Poisson solvers on Gauss-Lobatto grids.
ne plus ultra primality testing for machine-sized integers
A crate with relatively fast functions for factoring unsigned integers
A FRACTRAN interpreter
Pure-Rust port of the Bioconductor limma differential-expression package