Lattice Point Enumeration software is a specialized tool that counts and identifies lattice points.
Lattice Point Enumeration is a software specifically developed for solving the problem of counting and identifying lattice points inside convex polytopes, as well as integer programs. The software incorporates an implementation of Barvinok's algorithm, which makes it efficient in solving these problems.
One notable feature of the software is that it is designed to build and run smoothly on different UNIX systems. It employs GNU Autoconf and Automake, making it more versatile compared to other software that is only compatible with GNU/Linux on the x86 architecture.
In terms of performance, Lattice Point Enumeration is optimized to run faster than LattE, one of the traditional algorithms in this field. The developers achieved this by introducing various micro-optimizations and code clean-ups, making it nearly 25% faster.
The software also includes new algorithms like Primal Irrational Decomposition, All-Primal Irrational Decomposition, Exponential Substitution, and Non-unimodular Enumeration. Using a combination of these algorithms results in superior performance in some examples, achieving faster results by several orders of magnitude compared to traditional algorithms.
The current release of Lattice Point Enumeration fixes a build problem on Solaris/SPARC using GCC 4.2.0.
Overall, Lattice Point Enumeration is a powerful software for counting lattice points inside convex polytopes and solving integer programs. It boasts of efficient performance and inclusion of new algorithms, making it a suitable choice for software developers and researchers in this field.
One notable feature of the software is that it is designed to build and run smoothly on different UNIX systems. It employs GNU Autoconf and Automake, making it more versatile compared to other software that is only compatible with GNU/Linux on the x86 architecture.
In terms of performance, Lattice Point Enumeration is optimized to run faster than LattE, one of the traditional algorithms in this field. The developers achieved this by introducing various micro-optimizations and code clean-ups, making it nearly 25% faster.
The software also includes new algorithms like Primal Irrational Decomposition, All-Primal Irrational Decomposition, Exponential Substitution, and Non-unimodular Enumeration. Using a combination of these algorithms results in superior performance in some examples, achieving faster results by several orders of magnitude compared to traditional algorithms.
The current release of Lattice Point Enumeration fixes a build problem on Solaris/SPARC using GCC 4.2.0.
Overall, Lattice Point Enumeration is a powerful software for counting lattice points inside convex polytopes and solving integer programs. It boasts of efficient performance and inclusion of new algorithms, making it a suitable choice for software developers and researchers in this field.
What's New
Version 1.2-mk-0.8.1: N/A