METIS Program for Graph Partitioning, Finite Element Analysis, and Fill Order Reduction
- 详细技术说明
- None
- *Abstract
-
METIS is a set of serial programs for graph partitioning, finite element analysis, and fill order reduction for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes developed in the University of MinnesotaΓÇÖs Digital Technology Center (DTC) labs.
- *Principal Investigation
-
Name: George Karypis, PhD, Professor
Department: Department of Computer Science and Engineering, College of Science and Engineering
- 国家/地区
- 美国
欲了解更多信息，请点击 这里
