diophantine alternatives and similar packages
Based on the "Math" category.
Alternatively, view diophantine alternatives based on common mentions on social networks and blogs.
-
vector
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework . -
statistics
A fast, high quality library for computing with statistics in Haskell. -
HerbiePlugin
GHC plugin that improves Haskell code's numerical stability -
hgeometry
HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees. -
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). -
computational-algebra
General-Purpose Computer Algebra System as an EDSL in Haskell -
mwc-random
A very fast Haskell library for generating high quality pseudo-random numbers. -
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. -
matrix
A Haskell native implementation of matrices and their operations. -
vector-space
Vector & affine spaces, linear maps, and derivatives -
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) -
cf
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct) -
optimization
Some numerical optimization methods implemented in Haskell -
rampart
:european_castle: Determine how intervals relate to each other. -
safe-decimal
Safe and very efficient arithmetic operations on fixed decimal point numbers -
equational-reasoning
Agda-style equational reasoning in Haskell -
sbvPlugin
Formally prove properties of Haskell programs using SBV/SMT. -
monoid-subclasses
Subclasses of Monoid with a solid theoretical foundation and practical purposes -
polynomial
Haskell library for manipulating and evaluating polynomials -
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. -
modular-arithmetic
A useful type for working with integers modulo some constant. -
manifold-random
Coordinate-free hypersurfaces as Haskell types
WorkOS - The modern identity platform for B2B SaaS
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of diophantine or a related project?
README
Math.Diophantine
A quadratic diophantine equation solving library for haskell.
Overview:
This library is designed to solve for equations in the form of:
ax^2 + bxy + cy^2 + dx + ey + f = 0
Throughout the library, the variables (a,b,c,d,e,f) will always refer to these coefficients. This library will also use the alias:
type Z = Integer
to shorten the type declerations of the data types and functions.
Installation:
To install the library, just use cabal along with the provided install files.
Use:
import the library with:
import module Math.Diophantine
The most import function of this library is solve :: Equation -> Either
SolveError Solution
.
The types of equations that this library can solve are defined by the different
instances of Equation
:
GeneralEquation Z Z Z Z Z Z
- where the six Integers coincide with the six coefficients.LinearEquation Z Z Z
- where the 3 integers are d, e, and f.SimpleHyperbolicEquation Z Z Z Z
- where the 3 integers are b, d, e, and f.ElipticalEquation Z Z Z Z Z Z
- where the six Integers coincide with the six coefficients.ParabolicEquation Z Z Z Z Z Z
- where the six Integers coincide with the six coefficients.HyperbolicEquation Z Z Z Z Z Z
- where the six Integers coincide with the six coefficients.
For most cases, one will want to call solve with a GeneralEquation. A
GeneralEquation is used when one does not know the type of equation before hand,
or wants to take advantage of the libraries ability to detirmine what kind of
form it fits best. One can call specializeEquation
to convert a
GeneralEquation into the best specialized equation that it matches. This
function is called within solve, so one can pass any type of function to solve.
The specific functions will try to match to a GeneralEquation if they can;
however, they will throw an error if they cannot. The error behavior exists only
because these functions should only be called directly if and only if you know
at compile time that this function will only ever recieve the proper form. One
may want to use these directly for a speed increase, or to clarify a section of
code. The solve* functions will return a Solution. Solutions are as follows:
ZxZ
- ZxZ is the cartesian product of Z and Z, or the set of all pairs of integers. This Solution denotes cases where all pairs will satisfy your equation, such as 0x + 0y = 0.NoSolutions
- This Solution denotes that for all (x,y) in Z cross Z, no pair satisfies the equation.SolutionSet [(Z,Z)]
- This Solution denotes that for all pairs (x,y) in this set, they will satisfy the given equation.
There is also a readEquation :: String -> Either ParseError Equation
and
solveString :: String -> Either SolveError Solution
for parsing equations out
of strings. This will do some basic simplification of the equation.
TODO:
- Finish the implementation of solveHyperbolic