A comparative study of efficient multigrid solvers for high-order local discontinuous Galerkin methods: Poisson, elliptic interface, and multiphase Stokes problems

We design and investigate efficient multigrid solvers for multiphase Stokes problems discretised via mixed-degree local discontinuous Galerkin methods. Using the template of a standard multigrid V-cycle, we develop a smoother analogous to element-wise block Gauss-Seidel, except the diagonal block inverses are replaced with an approximation that balances the smoothing of the velocity and pressure variables, factoring in the unequal scaling of the various Stokes system operators, and optimised via two-grid local Fourier analysis. We evaluate the performance of the multigrid solver across an extensive range of two- and three-dimensional test problems, including steady-state and unsteady, standard-form and stress-form, single-phase and high-contrast multiphase Stokes problems, with multiple kinds of boundary conditions and various choices of polynomial degree. In the lowest-degree case, i.e., that of piecewise constant pressure fields, we observe reliable multigrid convergence rates, though not especially fast. However, in every other case, we see rapid convergence rates matching those of classical Poisson-style geometric multigrid methods; e.g., 5 iterations reduce the Stokes system residual by 5 to 10 orders of magnitude.

Authors

Institutions

Publication Details

Journal
Communications in Applied Mathematics and Computational Science
Published
2025-09-26
DOI
https://doi.org/10.2140/camcos.2025.20.253
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A comparative study of efficient multigrid solvers for high-order local discontinuous Galerkin methods: Poisson, elliptic interface, and multiphase Stokes problems

Robert I. Saye
Communications in Applied Mathematics and Computational Science
Advanced Numerical Methods in Computational Mathematics
article

A comparative study of efficient multigrid solvers for high-order local discontinuous Galerkin methods: Poisson, elliptic interface, and multiphase Stokes problems

Robert I. Saye
article en

Abstract

We design and investigate efficient multigrid solvers for multiphase Stokes problems discretised via mixed-degree local discontinuous Galerkin methods. Using the template of a standard multigrid V-cycle, we develop a smoother analogous to element-wise block Gauss-Seidel, except the diagonal block inverses are replaced with an approximation that balances the smoothing of the velocity and pressure variables, factoring in the unequal scaling of the various Stokes system operators, and optimised via two-grid local Fourier analysis. We evaluate the performance of the multigrid solver across an extensive range of two- and three-dimensional test problems, including steady-state and unsteady, standard-form and stress-form, single-phase and high-contrast multiphase Stokes problems, with multiple kinds of boundary conditions and various choices of polynomial degree. In the lowest-degree case, i.e., that of piecewise constant pressure fields, we observe reliable multigrid convergence rates, though not especially fast. However, in every other case, we see rapid convergence rates matching those of classical Poisson-style geometric multigrid methods; e.g., 5 iterations reduce the Stokes system residual by 5 to 10 orders of magnitude.

Communications in Applied Mathematics and Computational ScienceVol. 20(1)
Lawrence Berkeley National Laboratory (US)
Openalex Percentile: Top 72%
Advanced Numerical Methods in Computational Mathematics
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.