Gauß-Allianz Gauß-Allianz
HPC matters ::: Knowledge- & Technologytransfer
DE

Metis

Finite Element Algorithms
METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. (Source: https://github.com/easybuilders/easybuild-easyconfigs )
  http://glaros.dtc.umn.edu/gkhome/metis/metis/overview 

Locations and versions:

 TU Dresden  ZIB
(Click to refine by location - Reset filter - Expand all - Collapse all)

Major 5

    5.1.0  TU Dresden  ZIB

Major 4

    4.0.3  TU Dresden