Rational methods for abstract linear initial boundary value problems without order reduction

Abstract

Given an $A$-stable rational approximation to $e^z$ of order $p$, numerical procedures are suggested to time integrate abstract, well-posed IBVPs, with time-dependent source term $f$ and boundary value $g$. These procedures exhibit the optimal order $p$ and can be implemented by using just one single evaluation of $f$ and $g$ per step, i.e., no evaluations of the derivatives of data are needed, and are of practical use at least for $p\le 6$. The full discretization is also studied and the theoretical results are corroborated by numerical experiments.