Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.39303

A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases

Chunsheng Feng·Shuai Liu·Linjie Zhang·Zirui Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Algebraic multigrid (AMG) is one of the most effective algorithms for solving large sparse linear systems and consists of a setup phase followed by a solve phase. As supercomputer performance improves and the number of MPI processes increases, AMG faces serious challenges in algorithmic scalability and parallel scalability. To address these issues, we propose an asynchronous concurrent algebraic multigrid (ACAMG) model based on an MPI process grouping strategy for setup and solve. The setup and solve phases execute asynchronously and concurrently on separate MPI process groups. This organization can both preserve AMG hierarchy quality through an appropriate choice of the setup-group size and achieve time overlap between the two phases through asynchronous concurrent execution. Based on this model, we design and implement the MPI ACAMG algorithm. Theoretical analysis and numerical experiments show that the algorithm exhibits better algorithmic and parallel scalability. For example, for a three-dimensional diffusion problem with spatially localized anisotropy, ACAMG not only reduces the solve-phase iteration count compared with the conventional method, but also achieves speedups of 4.74 and 19.36 at 64 and 128 processes, respectively.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chunsheng Feng, Shuai Liu, Linjie Zhang, Zirui Zhu. 2026-10-29. A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases. https://arxiv.org/abs/2610.39303

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗
arXiv2026

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗
arXiv2026

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗