Pith. sign in

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

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

math.DS 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • The Pantelides algorithm for delay differential-algebraic equations math.DS · 2019-08-05 · conditional · none · ref 1 · internal anchor

    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.