StructMG: A Fast and Scalable Structured Algebraic Multigrid

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zong, Yi, Yu, Peinan, Huang, Haopeng, Hu, Zhengding, Wang, Xinliang, Wang, Qin, Zhang, Chensong, Xu, Xiaowen, Sun, Jian, Zhou, Yongxiao, Xue, Wei
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912453381586944
author Zong, Yi
Yu, Peinan
Huang, Haopeng
Hu, Zhengding
Wang, Xinliang
Wang, Qin
Zhang, Chensong
Xu, Xiaowen
Sun, Jian
Zhou, Yongxiao
Xue, Wei
author_facet Zong, Yi
Yu, Peinan
Huang, Haopeng
Hu, Zhengding
Wang, Xinliang
Wang, Qin
Zhang, Chensong
Xu, Xiaowen
Sun, Jian
Zhou, Yongxiao
Xue, Wei
contents Parallel multigrid is widely used as preconditioners in solving large-scale sparse linear systems. However, the current multigrid library still needs more satisfactory performance for structured grid problems regarding speed and scalability. Based on the classical 'multigrid seesaw', we derive three necessary principles for an efficient structured multigrid, which instructs our design and implementation of StructMG, a fast and scalable algebraic multigrid that constructs hierarchical grids automatically. As a preconditioner, StructMG can achieve both low cost per iteration and good convergence when solving large-scale linear systems with iterative methods in parallel. A stencil-based triple-matrix product via symbolic derivation and code generation is proposed for multi-dimensional Galerkin coarsening to reduce grid complexity, operator complexity, and implementation effort. A unified parallel framework of sparse triangular solver is presented to achieve fast convergence and high parallel efficiency for smoothers, including dependence-preserving Gauss-Seidel and incomplete LU methods. Idealized and real-world problems from radiation hydrodynamics, petroleum reservoir simulation, numerical weather prediction, and solid mechanics, are evaluated on ARM and X86 platforms to show StructMG's effectiveness. In comparison to \textit{hypre}'s structured and general multigrid preconditioners, StructMG achieves the fastest time-to-solutions in all cases with average speedups of 15.5x, 5.5x, 6.7x, 7.3x over SMG, PFMG, SysPFMG, and BoomerAMG, respectively. StructMG also significantly improves strong and weak scaling efficiencies.
format Preprint
id arxiv_https___arxiv_org_abs_2506_21932
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle StructMG: A Fast and Scalable Structured Algebraic Multigrid
Zong, Yi
Yu, Peinan
Huang, Haopeng
Hu, Zhengding
Wang, Xinliang
Wang, Qin
Zhang, Chensong
Xu, Xiaowen
Sun, Jian
Zhou, Yongxiao
Xue, Wei
Numerical Analysis
Computational Engineering, Finance, and Science
Performance
Parallel multigrid is widely used as preconditioners in solving large-scale sparse linear systems. However, the current multigrid library still needs more satisfactory performance for structured grid problems regarding speed and scalability. Based on the classical 'multigrid seesaw', we derive three necessary principles for an efficient structured multigrid, which instructs our design and implementation of StructMG, a fast and scalable algebraic multigrid that constructs hierarchical grids automatically. As a preconditioner, StructMG can achieve both low cost per iteration and good convergence when solving large-scale linear systems with iterative methods in parallel. A stencil-based triple-matrix product via symbolic derivation and code generation is proposed for multi-dimensional Galerkin coarsening to reduce grid complexity, operator complexity, and implementation effort. A unified parallel framework of sparse triangular solver is presented to achieve fast convergence and high parallel efficiency for smoothers, including dependence-preserving Gauss-Seidel and incomplete LU methods. Idealized and real-world problems from radiation hydrodynamics, petroleum reservoir simulation, numerical weather prediction, and solid mechanics, are evaluated on ARM and X86 platforms to show StructMG's effectiveness. In comparison to \textit{hypre}'s structured and general multigrid preconditioners, StructMG achieves the fastest time-to-solutions in all cases with average speedups of 15.5x, 5.5x, 6.7x, 7.3x over SMG, PFMG, SysPFMG, and BoomerAMG, respectively. StructMG also significantly improves strong and weak scaling efficiencies.
title StructMG: A Fast and Scalable Structured Algebraic Multigrid
topic Numerical Analysis
Computational Engineering, Finance, and Science
Performance
url https://arxiv.org/abs/2506.21932