normaliz-3.10.1-2.1 RPM for s390x

From OpenSuSE Ports Tumbleweed for s390x

Normaliz is a tool for computations in affine monoids, vector configurations,
lattice polytopes, and rational cones. It supports,

* convex hulls and dual cones
* conversion from generators to constraints and vice versa
* triangulations, disjoint decompositions and Stanley decompositions
* Hilbert basis of rational, not necessarily pointed cones
* normalization of affine monoids
* lattice points of rational polytopes and (unbounded) polyhedra
* Hilbert (or Ehrhart) series and (quasi) polynomials under
  Z-gradings (for example, for rational polytopes)
* generalized (or weighted) Ehrhart series and Lebesgue integrals of
  polynomials over rational polytopes via NmzIntegrate

Provides

• normaliz
• normaliz(s390-64)

Requires

• libc.so.6()(64bit)
• libc.so.6(GLIBC_2.2)(64bit)
• libc.so.6(GLIBC_2.34)(64bit)
• libc.so.6(GLIBC_2.4)(64bit)
• libeanticxx.so.3()(64bit)
• libgcc_s.so.1()(64bit)
• libgcc_s.so.1(GCC_3.0)(64bit)
• libgcc_s.so.1(GCC_3.3.1)(64bit)
• libgmp.so.10()(64bit)
• libnormaliz.so.3()(64bit)
• libstdc++.so.6()(64bit)
• libstdc++.so.6(CXXABI_1.3)(64bit)
• libstdc++.so.6(CXXABI_1.3.9)(64bit)
• libstdc++.so.6(GLIBCXX_3.4)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.11)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.21)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.29)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.32)(64bit)
• libstdc++.so.6(GLIBCXX_3.4.9)(64bit)
• rpmlib(CompressedFileNames) <= 3.0.4-1
• rpmlib(FileDigests) <= 4.6.0-1
• rpmlib(PayloadFilesHavePrefix) <= 4.0-1
• rpmlib(PayloadIsZstd) <= 5.4.18-1

License

GPL-3.0-or-later

Changelog

* Sat Dec 23 2023 Jan Engelhardt <jengelh@inai.de>
  - Add 0001-Add-FLINT-3-support.patch
* Wed Jun 28 2023 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.1
    * Improved the patching variant of the project-and-lift
      algorithm for lattice points in polytopes.
* Tue Jan 31 2023 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.10.0
    * This release adds general affine monoids and binomial ideals
      to Normaliz. In particular, it computes:
    * minimal systems of generators (Hilbert bases) of affine monoids
    * Hilbert series of affine monoids
    * singular loci of affine monoid algebras
    * Markov and Gröbner bases of lattice ideals
    * affine monoids from binomial ideals
* Wed Dec 21 2022 Jan Engelhardt <jengelh@inai.de>
  - normaliz-devel needs e-antic-devel for headers.
* Thu Aug 25 2022 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.9.4
    * New: A variant of project-and-lift for "positive systems",
      i.e. diophantine linear systems whose solutions are
      nonnegative and for which Normaliz can derive upper bounds
      for all coordinates directly from the input inequalities and
      equations.
    * Lattice points in polytopes can be constrained by polynomial
      equations and inequalities.
* Wed Apr 20 2022 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.9.3
    * Build system updates
    * New reference manual, NmzShortRef.pdf
  - Ship documentation.
* Mon Feb 07 2022 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.9.2
    * It is now possible to construct a cone in libnormaliz or
      PyNormaliz from an input file, and input files now allow the
      definition of sparse vectors with ranges of indices.
* Wed Sep 01 2021 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.9.1
    * This simplifies the handling of distributed computations in
      connection with volume by signed decomposition. There are a
      few other improvements.
* Fri Jul 02 2021 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.9.0
    * Normaliz now uses e-antic for algebraic polyhedra.
    * Added the Lawrence algorithm for polytope volumes by signed
      decomposition into simplices.
    * The descent algorithm for volumes now has a variant exploiting
      isomorphisms of faces.
* Thu Feb 11 2021 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.10
    * New data structure for the return of triangulations and other
      decompositions by libnormaliz.
* Fri Oct 02 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.9
    * New extensions:
    * Input types rational_lattice and rational_offset. They allow
      to choose an arbitrary sublattice of the rational space as
      the lattice of reference.
    * Computation goal IsEmptySemiOpen. It allows to check the
      emptyness of semiopen polyhedra defined by inequalities
      and strict inequalities.
    * Computation goals DualFaceLattice, DualFVector, DualIncidence
      computing the face lattice etc. for the dual cone.
    * Computation goal TriangulationGenerators: it replaces
      unstable Generators, and the name says explicitly for what it
      is meant.
* Tue Sep 01 2020 Jan Engelhardt <jengelh@inai.de>
  - Enable flint integration
* Sat Aug 29 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.8
    * No user-visible changes; a build fix for Debian packaging.
* Fri Jul 31 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.7
    * It is now possible to check the emptyness of semiopen
      polyhedra via the new computation goal IsEmptySemiopen. The
      '"open faces" are defined by excluded_faces and
      inhom_excluded_faces.
* Fri Jun 05 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.5
    * New feature: computation of refined triangulations using all
      input generators or all lattice points in a polytope or being
      unimodular.
* Fri Feb 14 2020 Jan Engelhardt <jengelh@inai.de>
  - Update to release 3.8.4
    * Use of precomputed data newly designed.
    * New versions of CoCoALib and nauty integrated.

Files

/usr/bin/normaliz
/usr/share/doc/packages/normaliz
/usr/share/doc/packages/normaliz/NmzShortRef.pdf
/usr/share/doc/packages/normaliz/Normaliz.pdf
/usr/share/licenses/normaliz
/usr/share/licenses/normaliz/COPYING

Generated by rpm2html 1.8.1

Fabrice Bellet, Sat Mar 9 12:50:11 2024