Main Article Content
We examine dierent aggregation schemes for k-cycle AMG. With real-life examples from computational uid dynamics, we conrm that using aggregates of mainly four nodes results in very ecient methods. However, we show also that the k-cycle aggregation AMG in its known form becomes even more ecient, if simpler aggregation schemes skipping the explicit calculation of intermediate coarse-grid operators are employed.
How to Cite
EMANS, Maximilian. Aggregation schemes for k-cycle AMG. Proceedings of the Conference Algoritmy, [S.l.], p. 141-150, nov. 2015. Available at: <http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/algoritmy/article/view/324>. Date accessed: 17 oct. 2017.