CF-UAMG: A Coarse/Fine Splitting-Based Parallel Unsmoothed Aggregation Algebraic Multigrid Method

In this paper, we propose a coarse/fine splitting-based parallel unsmoothed aggregation algebraic multigrid (AMG) method, referred to as CF-UAMG. The proposed method utilizes the strong-connection structure identified by classical AMG (C-AMG) coarse/fine splitting to guide the selection of aggregate roots and the formation of aggregates, aiming to improve the quality of the aggregation-based coarse space and thus the convergence of unsmoothed aggregation AMG (UA-AMG). We also prove uniform two-grid convergence of CF-UAMG with a convergence bound independent of the matrix size for symmetric positive definite M-matrices with nonnegative row sums. Numerical experiments on three classes of three-dimensional problems, including Poisson-type equations, radiation diffusion equations, and incompressible Navier-Stokes equations, demonstrate the robustness both in convergence and parallelism of CF-UAMG. Compared with UA-AMG methods employing four commonly used aggregation algorithms, CF-UAMG achieves average speedups of 1.29x, 2.04x, and 1.94x for the three classes of problems, respectively.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16920
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

CF-UAMG: A Coarse/Fine Splitting-Based Parallel Unsmoothed Aggregation Algebraic Multigrid Method

Zhibo Fan, Silu Huang, Shaoliang Hu, Xiaowen Xu
arXiv (Cornell University)
Matrix Theory and Algorithms
preprint

CF-UAMG: A Coarse/Fine Splitting-Based Parallel Unsmoothed Aggregation Algebraic Multigrid Method

Zhibo Fan, Silu Huang, Shaoliang Hu, Xiaowen Xu
preprint en

Abstract

In this paper, we propose a coarse/fine splitting-based parallel unsmoothed aggregation algebraic multigrid (AMG) method, referred to as CF-UAMG. The proposed method utilizes the strong-connection structure identified by classical AMG (C-AMG) coarse/fine splitting to guide the selection of aggregate roots and the formation of aggregates, aiming to improve the quality of the aggregation-based coarse space and thus the convergence of unsmoothed aggregation AMG (UA-AMG). We also prove uniform two-grid convergence of CF-UAMG with a convergence bound independent of the matrix size for symmetric positive definite M-matrices with nonnegative row sums. Numerical experiments on three classes of three-dimensional problems, including Poisson-type equations, radiation diffusion equations, and incompressible Navier-Stokes equations, demonstrate the robustness both in convergence and parallelism of CF-UAMG. Compared with UA-AMG methods employing four commonly used aggregation algorithms, CF-UAMG achieves average speedups of 1.29x, 2.04x, and 1.94x for the three classes of problems, respectively.

arXiv (Cornell University)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon