Lattice point Enumeration 1.2-mk-0.8.1

Lattice point Enumeration is a computer software dedicated to the problems of counting and detecting lattice points.

  Add it to your Download Basket!

 Add it to your Watch List!

0/5

Rate it!
send us
an update
LICENSE TYPE:
GPL (GNU General Public License) 
USER RATING:
2.5/5 13
DEVELOPED BY:
Matthias Koeppe
HOMEPAGE:
www.math.uni-magdeburg.de
CATEGORY:
ROOT \ Science and Engineering \ Mathematics
Lattice point Enumeration is a computer software dedicated to the problems of counting and detecting lattice points inside convex polytopes, and the solution of integer programs. It contains an implementation of Barvinok's algorithm.

Here are some key features of "Lattice point Enumeration":

Using GNU Autoconf and Automake, it easily builds and runs on a variety of UNIX systems, rather than just on GNU/Linux on the x86 architecture.
Various micro-optimizations and code clean-ups make the code more robust and about 25% faster than LattE.

New algorithms are implemented:

- Primal irrational decomposition
- All-primal irrational decomposition
- Exponential substitution
- Non-unimodular enumeration

A combination of these new algorithms is much faster (for some examples, by several orders of magnitude) than the traditional algorithms implemented in LattE.

What's New in This Release:

A build problem on Solaris/SPARC using GCC 4.2.0 was fixed.

Last updated on July 5th, 2007

#point Enumeration #Lattice Enumeration #detecting lattice #Lattice #point #Enumeration #detecting

Add your review!

SUBMIT