Self compiled Modules

Trilinos version 11.4.3

version 2.2

version 2.3

version 3.4.4

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.

ParMETIS is an MPI-based parallel library that implements a variety of algorithms for partitioning unstructured graphs, meshes, and for computing fill-reducing orderings of sparse matrices. ParMETIS extends the functionality provided by METIS and includes routines that are especially suited for parallel AMR computations and large scale numerical simulations. The algorithms implemented in ParMETIS are based on the parallel multilevel k-way graph-partitioning, adaptive repartitioning, and parallel multi-constrained partitioning schemes. ParMETIS provides the following five major functions: Graph Partitioning, Mesh Partitioning, Graph Repartitioning, Partitioning Refinement, Matrix Reordering.

Documentation and examples for work with METIS/ParMETIS

METIS / PARMETIS is required by Trilinos (necessary for deal.ii)

                          and deal.ii (beginning with 7.3 deal.ii will switch to some other software)

Trilinos 10.12.2 requires METIS = 4.1.2 (no 4.0.3)

Trilinos 11.xx.x requires METIS > 4.1.2

deal.ii 7.3 requires METIS >= 5.0.3

The basic atlas Implementation is used (/usr/lib/liblapack.so.3gf, /usr/lib/libblas.so.3gf). For switching diverent Implementations and more information see: BLAS/LAPACK