Decoupling multistep schemes for elliptic–parabolic problems

We study the construction and convergence of decoupling multistep schemes of higher order using the backward differentiation formulae for an elliptic–parabolic problem, which includes multiple-network poroelasticity as a special case. These schemes were first introduced in [Altmann, Maier, Unger, BIT Numer. Math., 64:20, 2024], where a convergence proof for the second-order case is presented. Here, we present a slightly modified version of these schemes using a different construction of related time delay systems. We present a novel convergence proof relying on concepts from G-stability applicable for any order and providing a sharper characterization of the required weak coupling condition. The key tool for the convergence analysis is the construction of a weighted norm enabling a telescoping argument for the sum of the errors.

Authors

Publication Details

Journal
KITopen
Published
2026-10-09
DOI
https://doi.org/10.5445/ir/1000197686
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decoupling multistep schemes for elliptic–parabolic problems

Abdullah Mujahid, Robert Altmann, Benjamin Unger
KITopen
Advanced Numerical Methods in Computational Mathematics
article

Decoupling multistep schemes for elliptic–parabolic problems

Abdullah Mujahid, Robert Altmann, Benjamin Unger
article en

Abstract

We study the construction and convergence of decoupling multistep schemes of higher order using the backward differentiation formulae for an elliptic–parabolic problem, which includes multiple-network poroelasticity as a special case. These schemes were first introduced in [Altmann, Maier, Unger, BIT Numer. Math., 64:20, 2024], where a convergence proof for the second-order case is presented. Here, we present a slightly modified version of these schemes using a different construction of related time delay systems. We present a novel convergence proof relying on concepts from G-stability applicable for any order and providing a sharper characterization of the required weak coupling condition. The key tool for the convergence analysis is the construction of a weighted norm enabling a telescoping argument for the sum of the errors.

KITopen
Openalex Percentile: Top 18%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.