Pith. sign in

REVIEW

BDDC preconditioners for divergence free virtual element discretizations of the Stokes equations

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

arxiv 2207.01361 v1 pith:5D5X2R34 submitted 2022-07-04 math.NA cs.NA

classification math.NAcs.NA
keywords equationslinearmethodpreconditionedsystembddcconvergenceelement
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The Virtual Element Method (VEM) is a new family of numerical methods for the approximation of partial differential equations, where the geometry of the polytopal mesh elements can be very general. The aim of this article is to extend the balancing domain decomposition by constraints (BDDC) preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations. Under suitable hypotesis on the choice of the primal unknowns, the preconditioned linear system results symmetric and positive definite, thus the preconditioned conjugate gradient method can be used for its solution. We provide a theoretical convergence analysis estimating the condition number of the preconditioned linear system. Several numerical experiments validate the theoretical estimates, showing the scalability and quasi-optimality of the method proposed. Moreover, the solver exhibits a robust behavior with respect to the shape of the polygonal mesh elements. We also show that a faster convergence could be achieved with an easy to implement coarse space, slightly larger than the minimal one covered by the theory.

Discussion (0). Continue with ORCID to comment.

Pith tools