Independent set-based coarse-grid selection algorithms for algebraic multigrid are defined by their policies for weight initialization, independent set selection, and weight update. In this paper, we develop theory demonstrating that algorithms employing the same policies produce identical coarse grids, regardless of the implementation. The coarse-grid invariance motivates a new coarse-grid selection algorithm, called Bucket-Sorted Independent Sets (BSIS), that is more efficient than an existing algorithm (CLJP-c) using the same policies. Experimental results highlighting the efficiency of two versions of the new algorithm are presented, followed by a discussion of BSIS in a parallel setting..
|Original language||English (US)|
|Number of pages||19|
|Journal||Electronic Transactions on Numerical Analysis|
|State||Published - 2010|
- Algebraic multigrid
- Coarse-grid selection
ASJC Scopus subject areas