LogoopenSUSE Build Service > Projects
Sign Up | Log In

Serial Graph Partitioning and Fill-reducing Matrix Ordering

METIS is a family of programs for partitioning unstructured graphs and hypergraph and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems. 

This is a modified version of Metis for Code-Aster.

Source Files

Filename Size Changed Actions
aster.spec 3.84 KB over 7 years ago Download File
metis-edf-4.1-2-Makefile.patch 4.17 KB over 7 years ago Download File
metis-edf-4.1-2-configure.patch 1.77 KB over 7 years ago Download File
metis-edf-4.1-2.noarch.tar.bz2 563 KB over 7 years ago Download File
metis-edf-4.1-no-return-in-non-void-fix.patch 1.09 KB over 7 years ago Download File
metis-edf.spec 4.14 KB over 7 years ago Download File

Comments for home:scorot (0)