Improving Interpolation in BoomerAMG

Nolting, J ; Yang, U

Lawrence Livermore National Laboratory

关键词: 99 General And Miscellaneous//Mathematics, Computing, And Information Science;    Implementation;    Design;    Exploration;    Algorithms;   

DOI  :  10.2172/894324
RP-ID  :  UCRL-TR-224345
RP-ID  :  W-7405-ENG-48
RP-ID  :  894324

美国|英语

来源: UNT Digital Library

【 摘 要 】

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.