Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
The authors develop an algebraic multigrid algorithm for symmetric positive definite linear systems based on a concept of smoothed aggregation relying on a suitable decomposition of the set of nodes and a corresponding tentative interpolation. The coarsening is governed by abstract multigrid theory and by requirements reflecting practical experience. Favorable behaviour of the algorithm is demonstrated on eleven real-world examples from solid elasticity, plate bending, and shells. The code is available via internet on the address given in the paper.
symmetric positive definite linear systems
scientific article; zbMATH DE number 878402
scientific article