Weighting the recursive spectral bisection algorithm for unstructured grids
Conference
·
OSTI ID:125594
- Lawrence Livermore National Lab., CA (United States)
When solving partial differential equations numerically on parallel computers it is desirable to decompose the domain on which we are solving the equations in such a way as to equalize the workload among the processors while minimizing the communication between them. This is equivalent to finding a partition of the graph representing the calculation into equal subgraphs cutting as few edges as possible. One such algorithm in use is the recursive spectral bisection algorithm (RSB), (1) generate the Laplace matrix for the graph representing the dependencies between the calculation taking place at each vertex of the graph. (2) Compute the eigenvector corresponding to the smallest non-zero eigen-value, called the Fiedler vector. (3) Sort the vertices according to size of entries in the Fiedler vector. (4) Assign half the vertices into each subgraph.
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 125594
- Report Number(s):
- CONF-950212--
- Country of Publication:
- United States
- Language:
- English
Similar Records
How good is recursive bisection?
A graph contraction algorithm for the fast calculation of the Fiedler vector of a graph
Toward a parallel recursive spectral bisection mapping tool
Journal Article
·
Mon Sep 01 00:00:00 EDT 1997
· SIAM Journal on Scientific Computing
·
OSTI ID:532989
A graph contraction algorithm for the fast calculation of the Fiedler vector of a graph
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125587
Toward a parallel recursive spectral bisection mapping tool
Conference
·
Sun Feb 28 23:00:00 EST 1993
·
OSTI ID:10131862