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

Institutions

Publication Details

Journal
SMAI Journal of Computational Mathematics
Published
2026-08-26
DOI
https://doi.org/10.5802/smai-jcm.152
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decoupling multistep schemes for elliptic–parabolic problems

Benjamin Unger, Abdullah Mujahid, Robert Altmann
SMAI Journal of Computational Mathematics
Advanced Numerical Methods in Computational Mathematics
article

Decoupling multistep schemes for elliptic–parabolic problems

Benjamin Unger, Abdullah Mujahid, Robert Altmann
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.

SMAI Journal of Computational MathematicsVol. 12
University of Stuttgart (DE), Karlsruhe Institute of Technology (DE), Simulation Technologies (United States) (US), Otto-von-Guericke-Universität Magdeburg (DE)
Deutsche Forschungsgemeinschaft, Universität Stuttgart, Singapore Institute of Manufacturing Technology
Openalex Percentile: Top 99%
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.