|
Graph
Partition |
|
- Computes high quality partitionings of very large graphs
quickly.
- Takes advantage of geometry information (when available) to
reduc$
without loss in quality.
|
|
Graph
Repartit$
|
|
- Computes high quality repartitions of adaptively refined
meshes q$
- Optimizes both the number of vertices that are moved as well
as t$
resulting partitioning.
|
|
Partitioning R$
|
|
- Improves the quality of partitions produced by other
partitioning$
|
|
Matrix
Reorder$
|
|
- Computes fill-reducing orderings of sparse matrices.
- Uses a node-based nested dissection algorithm that has been
shown$
outperform other popular reordering algorithms.
|
