REVIEW 2 cited by
Multigrid on unstructured meshes with regions of low quality cells
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Multigrid on unstructured meshes with regions of low quality cells
read the original abstract
The convergence of multigrid methods degrades significantly if a small number of low quality cells are present in a finite element mesh, and this can be a barrier to the efficient and robust application of multigrid on complicated geometric domains. The degraded performance is observed also if intermediate levels in a non-nested geometric multigrid problem have low quality cells, even when the fine grid is high quality. It is demonstrated for geometric multigrid methods that the poor convergence is due to the local failure of smoothers to eliminate parts of error around cells of low quality. To overcome this, a global--local combined smoother is developed to maintain effective relaxation in the presence of a small number of poor quality cells. The smoother involves the application of a standard smoother on the whole domain, followed by local corrections for small subdomains with low quality cells. Two- and three-dimensional numerical experiments demonstrate that the degraded convergence of multigrid for low quality meshes can be restored to the high quality mesh reference case using the proposed smoother. The effect is particularly pronounced for higher-order finite elements. The results provide a basis for developing efficient, non-nested geometric multigrid methods for complicated engineering geometries.
Forward citations
Cited by 2 Pith papers
-
An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
Agglomeration-based multigrid preconditioner improves convergence for DG-discretized cardiac electrophysiology models on unstructured polytopic grids with good scaling in polynomial degree and hierarchy depth.
-
An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
An R-tree-based agglomeration multigrid preconditioner makes PCG for the DG monodomain model converge in 6-13 iterations per time step across p=1..3, with 3-7.5x total-time speedups over AMG at high polynomial degree.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.