exp-pairs

Linear programming over exponent pairs

https://github.com/Bodigrim/exp-pairs

LTS Haskell 23.1:0.2.1.1
Stackage Nightly 2024-12-21:0.2.1.1
Latest on Hackage:0.2.1.1

See all snapshots exp-pairs appears in

GPL-3.0-only licensed by Andrew Lelechenko
Maintained by [email protected]
This version can be pinned in stack with:exp-pairs-0.2.1.1@sha256:db3263ed01a712bfacd96eea9e24ae9dd1dc02b9954e20e52f652d6765c5949d,3195

Module documentation for 0.2.1.1

exp-pairs Hackage Stackage LTS Stackage Nightly

Package implements an algorithm to minimize the maximum of a list of rational objective functions over the set of exponent pairs. See full description in

A. V. Lelechenko, Linear programming over exponent pairs. Acta Univ. Sapientiae, Inform. 5, No. 2, 271-287 (2013). http://www.acta.sapientia.ro/acta-info/C5-2/info52-7.pdf

A set of useful applications is also included, covering estimates of asymmetric divisor functions and moments of Riemann zeta-function.

Changes

Changes

Version 0.2.1.1

Switch benchmarks from gauge to tasty-bench.

Version 0.2.1.0

Improvements for 4D asymmetric divisor problems. Refine matrix manipulations.

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.