OpenAlex ·

A two-level preconditioner for discontinuous virtual element methods with irregular subdomains

Calvo Jg and César Herrera

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.18580
Original
Read it at the publisher
Topics
Computational ComplexityNumerical AnalysisComputational Physics

Abstract

We introduce and analyze a two-level overlapping additive Schwarz preconditioner for discontinuous Galerkin discretizations of virtual element spaces on general polygonal meshes in two dimensions, for a second-order elliptic problem whose coefficient is constant on each subdomain and may have large jumps across the interface. The discretization is a weighted symmetric interior penalty formulation: the averages carry the coefficient and the penalty is scaled by its harmonic mean across each edge, which keeps the method consistent and makes the constants of the analysis independent of the coefficient. The coarse space is obtained from a virtual, continuous partition of unity with a single degree of freedom per subdomain vertex, and is therefore applicable to the irregular subdomains produced by a graph partitioner; the discrete harmonic extension used to build it may be replaced by a cheaper projection onto polynomials of low degree. We prove that the condition number of the preconditioned system is bounded by $C(1+\log(H/h))(1+H/δ)$, where $H$, $h$ and $δ$ denote the subdomain diameter, the mesh size and the overlap, and where $C$ is independent of the number of subdomains and of the contrast of the coefficient, provided the latter is quasi-monotone. This is the same bound known for the conforming case and the analysis allows for hanging nodes. We also show, by an explicit example, that the quasi-monotonicity assumption cannot be dispensed with. Numerical experiments with structured triangular, hexagonal and Voronoi meshes, and with subdomains obtained both by uniform partitioning and by METIS, confirm the theory.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics