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, M. (2015). Aggregation schemes for k-cycle AMG. Proceedings Of The Conference Algoritmy, , 141-150. Retrieved from http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/algoritmy/article/view/324/229