Pith. sign in

REVIEW 1 cited by

Semi-explicit discretization schemes for weakly-coupled elliptic-parabolic problems

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 1909.03497 v1 pith:GS3IEQSL submitted 2019-09-08 math.NA cs.NA

classification math.NAcs.NA
keywords convergencesemi-explicitdelaydiscretizationelliptic-parabolicproblemsschemesolution
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove first-order convergence of the semi-explicit Euler scheme combined with a finite element discretization in space for elliptic-parabolic problems which are weakly coupled. This setting includes poroelasticity, thermoelasticity, as well as multiple-network models used in medical applications. The semi-explicit approach decouples the system such that each time step requires the solution of two small and well-structured linear systems rather than the solution of one large system. The decoupling improves the computational efficiency without decreasing the convergence rates. The presented convergence proof is based on an interpretation of the scheme as an implicit method applied to a constrained partial differential equation with delay term. Here, the delay time equals the used step size. This connection also allows a deeper understanding of the weak coupling condition, which we accomplish to quantify explicitly.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Pantelides algorithm for delay differential-algebraic equations

    math.DS 2019-08 conditional novelty 6.0 of 10

    A graph algorithm with equivalence classes extends the Pantelides structural analysis from DAEs to delay differential-algebraic equations and gives a necessary and sufficient termination condition.

Pith tools