Aggregation algorithms for k-cycle AMG in computational fluid dynamics
Summary: We present a systematic comparison of different aggregation schemes for AMG-based solvers in computational fluid dynamics. Our focus lies on the method of the Krylov-accelerated cycle which has very favourable properties for the applications on 3D unstructured meshed. While on conventional CPUs the \(k\)-cycle AMG in its known form with double-pairwise aggregation is shown to be approximately as fast as plain aggregation schemes (and therefore recommendable), the algorithm with plain aggregation becomes significantly more efficient on GPUs since the setup of this aggregation scheme is much leaner. Furthermore, we show that the solution phase of \(k\)-cycle AMG has excellent scaling properties on modern cluster hardware with up to 256 cores. However, common coarse-grid treatment techniques such as parallel direct solvers or agglomeration schemes form a bottleneck such that the scaling of the setup phase is considerably worse. Block-iterative methods improve the performance here.
- Benchmarking aggregation AMG for linear systems in CFD simulations of compressible internal flows
- Agglomeration multigrid for two-dimensional viscous flows
- An economical aggregation algorithm for algebraic multigrid (AMG)
- Aggregation-Based Algebraic Multigrid for Convection-Diffusion Equations
- Aggregation schemes for k-cycle AMG
- An implicit multigrid method by agglomeration applied to turbulent flows
- Agglomerated multigrid on hybrid unstructured meshes for compressible flow
- A cell agglomeration algorithm for accelerating detailed chemistry in CFD
- Efficient parallel AMG methods for approximate solutions of linear systems in CFD applications
This page was built for publication: Aggregation algorithms for \(k\)-cycle AMG in computational fluid dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753804)
