exp-pairs

Linear programming over exponent pairs https://github.com/Bodigrim/exp-pairs

Version on this page:0.2.0.0
LTS Haskell 12.22:0.1.6.0
Stackage Nightly 2018-12-12:0.2.0.0
Latest on Hackage:0.2.0.0

See all snapshots exp-pairs appears in

GPL-3 licensed by Andrew Lelechenko
Maintained by andrew.lelechenko@gmail.com

Module documentation for 0.2.0.0

There are no documented modules for this package.

Package implements an algorithm to minimize rational objective function over the set of exponent pairs

Changes

Changes

Version 0.2.0.0

Switch from Huxley’s exponent pair (2005) to Bourgain’s one (2017).

Version 0.1.5.0

Convenient combinators for linear forms and constraints. New experimental functions in Math.ExpPairs.Kratzel: tauabcd and tauA for general multidimensional divisor problems.

Version 0.1.4.0

Improve overall performance. Use Stern-Brocot tree for binary searches in Math.ExpPairs.Ivic.

Version 0.1.3.0

New functions in Math.ExpPairs.Ivic: reverseMOnS, checkAbscissa, findMinAbscissa, mBigOnHalf, reverseMBigOnHalf. Fast matrix multiplication via Makarov and Laderman algorithms. Rewrite from the scratch pretty printer of processes.

Depends on 5 packages:
Used by 1 package:
comments powered byDisqus