Extrapolation-Based Super-Convergent Implicit-Explicit Peer Methods with A-stable Implicit Part

In this paper, we extend the implicit-explicit (IMEX) methods of Peer type recently developed in [Lang, Hundsdorfer, J. Comp. Phys., 337:203--215, 2017] to a broader class of two-step methods that allow the construction of super-convergent IMEX-Peer methods with A-stable implicit part. IMEX schemes combine the necessary stability of implicit and low computational costs of explicit methods to efficiently solve systems of ordinary differential equations with both stiff and non-stiff parts included in the source term. To construct super-convergent IMEX-Peer methods with favourable stability properties, we derive necessary and sufficient conditions on the coefficient matrices and apply an extrapolation approach based on already computed stage values. Optimised super-convergent IMEX-Peer methods of order s+1 for s=2,3,4 stages are given as result of a search algorithm carefully designed to balance the size of the stability regions and the extrapolation errors. Numerical experiments and a comparison to other IMEX-Peer methods are included.Comment: 22 pages, 4 figures. arXiv admin note: text overlap with arXiv:1610.0051

Extrapolation-Based Implicit-Explicit Peer Methods with Optimised Stability Regions

In this paper we investigate a new class of implicit-explicit (IMEX) two-step methods of Peer type for systems of ordinary differential equations with both non-stiff and stiff parts included in the source term. An extrapolation approach based on already computed stage values is applied to construct IMEX methods with favourable stability properties. Optimised IMEX-Peer methods of order p = 2, 3, 4, are given as result of a search algorithm carefully designed to balance the size of the stability regions and the extrapolation errors. Numerical experiments and a comparison to other implicit-explicit methods are included.Comment: 21 pages, 6 figure

Peer Methods for the Solution of Large-Scale Differential Matrix Equations

We consider the application of implicit and linearly implicit (Rosenbrock-type) peer methods to matrix-valued ordinary differential equations. In particular the differential Riccati equation (DRE) is investigated. For the Rosenbrock-type schemes, a reformulation capable of avoiding a number of Jacobian applications is developed that, in the autonomous case, reduces the computational complexity of the algorithms. Dealing with large-scale problems, an efficient implementation based on low-rank symmetric indefinite factorizations is presented. The performance of both peer approaches up to order 4 is compared to existing implicit time integration schemes for matrix-valued differential equations.Comment: 29 pages, 2 figures (including 6 subfigures each), 3 tables, Corrected typo

Linear multistep methods for optimal control problems and applications to hyperbolic relaxation systems

We are interested in high-order linear multistep schemes for time discretization of adjoint equations arising within optimal control problems. First we consider optimal control problems for ordinary differential equations and show loss of accuracy for Adams-Moulton and Adams-Bashford methods, whereas BDF methods preserve high--order accuracy. Subsequently we extend these results to semi--lagrangian discretizations of hyperbolic relaxation systems. Computational results illustrate theoretical findings