A new aggregation algorithm based on coordinates partitioning recursively for algebraic multigrid method

DOI10.1016/j.cam.2018.05.052zbMath1422.65062OpenAlexW2809547582WikidataQ129628142 ScholiaQ129628142MaRDI QIDQ1789703

Jun Peng, Fu-Kang Yin, Jian-Ping Wu, Pei-Ming Guo, Jin-Hui Yang

Publication date: 10 October 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2018.05.052

zbMATH Keywords

preconditionergraph partitioningKrylov subspace methodaggregation based algebraic multigridsparse linear algebraic equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Uses Software

• LFA

Cites Work

• Unnamed Item
• Unnamed Item
• Towards algebraic multigrid for elliptic problems of second order
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid
• Black Box Multigrid with coarsening by a factor of three
• Aggregation-Based Algebraic Multigrid for Convection-Diffusion Equations
• Analysis of an aggregation‐based algebraic two‐grid method for a rotated anisotropic diffusion problem
• A multigrid method based on graph matching for convection–diffusion equations
• Aggregation-Based Algebraic Multilevel Preconditioning