FLINT (Fast Library for Number Theory)
-
Updated
Jun 10, 2024 - C
FLINT (Fast Library for Number Theory)
High-performance and differentiation-enabled nonlinear solvers (Newton methods), bracketed rootfinding (bisection, Falsi), with sparsity and Newton-Krylov support.
LinearSolve.jl: High-Performance Unified Interface for Linear Solvers in Julia. Easily switch between factorization and Krylov methods, add preconditioners, and all in one interface.
Tool for Solving Problems in Combinatorics and Computational Mathematics
PARAFAC2 for modeling multi-sample single-cell RNAseq.
ASAP in R
Numerical Linear Algebra
Source code for the book "Quantum Computing for Programmers", Cambridge University Press
(WIP) Esoteric Mathematic Library for Rust
Dockerfile factorization superset
Almost block diagonal matrices factorization and solving in Julia
Number theory: primes, arithmetic functions, modular computations, special sequences
python package implementing a multivariate Horner scheme for efficiently evaluating multivariate polynomials
A Python scikit for building and analyzing recommender systems
Big-integer calculator with factorization
EPR: A Factoring and Primality checking library for C++
I enjoyed playing with math to come up with this !
Rust General Number Field Sieve
Program for factorising Gaussian integers
Add a description, image, and links to the factorization topic page so that developers can more easily learn about it.
To associate your repository with the factorization topic, visit your repo's landing page and select "manage topics."