A Greedy Strategy for Coarse-Grid Selection

Abstract

Efficient solution of the very large linear systems that arise in numerical modelling of real-world applications is often only possible through the use of multilevel techniques. While highly optimized algorithms may be developed using knowledge about the origins of the matrix problem to be considered, much recent interest has been in the development of purely algebraic approaches that may be applied in many situations, without problem-specific tuning. Here, we consider an algebraic approach to finding the fine/coarse partitions needed in multilevel approaches. The algorithm is motivated by recent theoretical analysis of the performance of two common multilevel algorithms, multilevel block factorization and algebraic multigrid. While no guarantee on the rate of coarsening is given, the splitting is shown to always yield an effective preconditioner in the two-level sense. Numerical performance of two-level and multilevel variants of this approach is demonstrated in combination with both algebraic multigrid and multilevel block factorizations, and the advantages of each of these two algorithmic settings are explored.

DOI: 10.1137/060654062

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@article{MacLachlan2007AGS, title={A Greedy Strategy for Coarse-Grid Selection}, author={Scott P. MacLachlan and Yousef Saad}, journal={SIAM J. Scientific Computing}, year={2007}, volume={29}, pages={1825-1853} }