Improving Interpolation in BoomerAMG

Abstract

With new more aggressive coarsening algorithms that while reducing memory also degrade convergence often dramatically, it was imperative that new interpolation routines be implemented to recover this degradation. The implementation details and results for three new interpolation routines, standard, extended, and F-F, are presented in this paper. The project was focused on parallel implementation, so there is little theoretical analysis. The references contain much of the algorithmic design issues and analysis, if further understanding or exploration is needed, see [1][2][3]. It will be shown throughout this paper that long-range interpolation is needed for a number of problems, for some cases, there is almost a reduction in iterations by 2 orders of magnitude.

Related Papers

• Attribute Reduction Algorithm Based on Reduction Pruning(2007)
• → Achieving Efficient Decision Making Through Hybrid Reduction in Soft Set Theory(2017)2 cited
• → Novel Approaches to Knowledge Reduction in Inconsistent Decision Systems(2006)1 cited
• Regional systems of innovation and regional policy in Europe(2004)
• Effect of the Reduction on Centerline Segregation of Steel(2009)