The development of high performance, massively parallel computers and the increasing demands of computationally challenging applications have necessitated the development of scalable solvers and preconditioners. One of the most effective ways to achieve scalability is the use of multigrid or multilevel techniques. Algebraic multigrid (AMG) is a very efficient algorithm for solving large problems on unstructured grids. While much of it can be parallelized in a straightforward way, some components of the classical algorithm, particularly the coarsening process and some of the most efficient smoothers, are highly sequential, and require new parallel approaches. This chapter presents the basic principles of AMG and gives an overview of various parallel implementations of AMG, including descriptions of parallel coarsening schemes and smoothers, some numerical results as well as references to existing software packages. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Yang, U. M. (2006). Parallel algebraic multigrid methods - High performance preconditioners. Lecture Notes in Computational Science and Engineering, 51, 209–236. https://doi.org/10.1007/3-540-31619-1_6
Mendeley helps you to discover research relevant for your work.