Searcharxiv⌕ Search

arXiv subjects

Shaoliang Hu

Publications and source records attributed to Shaoliang Hu.

3 recordsLinked to original sources

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.

math.NA↗

A substructuring preconditioner with vertex-related interface solvers for elliptic-type equations in three dimensions

In this paper we propose a variant of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the proposed preconditioner, we use the simplest coarse solver associated with the finite element space induced by the coarse partition, and construct vertex-related inexact interface solvers based on overlapping domain decomposition with small overlaps. This new preconditioner has an important merit: its construction and efficiency do not depend on the concrete form of the considered elliptic-type equations. % in the sense that they not only are cheap but also are easy to implement. We apply the proposed preconditioner to solve the linear elasticity problems and Maxwell's equations in three dimensions. Numerical results show that the convergence rate of PCG method with the preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficients in the considered equations.

math.NA↗

Substructuring preconditioners with novel interface solvers for general elliptic-type equations in three dimensions

In this paper we propose two variants of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the new preconditioners, we use the simplest coarse solver associated with the finite element space induced by the coarse partition, and construct novel interface solvers based on some new observations. The resulting preconditioners share the merits of the non-overlapping domain decomposition method (DDM) and the overlapping DDM in the sense that they not only are cheap but also are easy to implement. We apply the proposed preconditioners to solve the linear elasticity problems and Maxwell's equations in three dimensions. Numerical results show that the convergence rate of PCG method with the preconditioners are nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficients in the considered equations.

math.NA↗