Runge-Kutta methods for linear semi-explicit operator differential-algebraic equations

As a first step towards time-stepping schemes for constrained PDE systems, this paper presents convergence results for the temporal discretization of operator DAEs. We consider linear, semi-explicit systems which include e.g. the Stokes equations or applications with boundary control. To guarantee u...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics of computation 2018-01, Vol.87 (309), p.149-174
Main Authors: ALTMANN, R., ZIMMER, C.
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:As a first step towards time-stepping schemes for constrained PDE systems, this paper presents convergence results for the temporal discretization of operator DAEs. We consider linear, semi-explicit systems which include e.g. the Stokes equations or applications with boundary control. To guarantee unique approximations, we restrict the analysis to algebraically stable Runge-Kutta methods for which the stability functions satisfy R(\infty )=0. As expected from the theory of DAEs, the convergence properties of the single variables differ and depend strongly on the assumed smoothness of the data.
ISSN:0025-5718
1088-6842
DOI:10.1090/mcom/3270