Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Compatible Relaxation and Coarsening in Algebraic Multigrid
Ist Teil von
SIAM journal on scientific computing, 2010-01, Vol.32 (3), p.1393-1416
Ort / Verlag
Philadelphia: Society for Industrial and Applied Mathematics
Erscheinungsjahr
2010
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Finally, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples. [PUBLICATION ABSTRACT]