Aggregation-Based Aggressive Coarsening with Polynomial Smoothing

DOI10.1007/978-3-319-05789-7_25MaRDI QIDQ3133637zbMATH OpenOpenAlexFDO

Authors J. Brannick

Publication date 5 February 2018

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.6305

zbMATH Keywords

finite elementgraph LaplacianPoisson problemalgebraic multigrid preconditionerconjugate gradient iterationpolynomial smootheralgebraic multilevel iteration

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05)

Abstract: This paper develops an algebraic multigrid preconditioner for the graph Laplacian. The proposed approach uses aggressive coarsening based on the aggregation framework in the setup phase and a polynomial smoother with sufficiently large degree within a (nonlinear) Algebraic Multilevel Iteration as a preconditioner to the flexible Conjugate Gradient iteration in the solve phase. We show that by combining these techniques it is possible to design a simple and scalable algorithm. Results of the algorithm applied to graph Laplacian systems arising from the standard linear finite element discretization of the scalar Poisson problem are reported.

Recommendations

• Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
• An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing
• Adaptive Smoothed Aggregation ($\alpha$SA)
• Improved convergence estimate for a multiply polynomially smoothed two-level method with an aggressive coarsening.
• Smoothed aggregation for difficult stretched mesh and coefficient variation problems
• Towards adaptive smoothed aggregation (\(\alpha\)SA) for nonsymmetric problems
• On long-range interpolation operators for aggressive coarsening
• Smoothed aggregation solvers for anisotropic diffusion
• Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing
• An Aggregation Multilevel Method Using Smooth Error Vectors

Cited in

(6)

• An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
• Spectral upscaling for graph Laplacian problems with application to reservoir simulation
• Multilevel preconditioning of graph-Laplacians: Polynomial approximation of the pivot blocks inverses
• On the approximation of Laplacian eigenvalues in graph disaggregation
• An efficient multigrid method for graph Laplacian systems
• Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs

This page was built for publication: Aggregation-Based Aggressive Coarsening with Polynomial Smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133637)