Multi-implicit peer two-step W-methods for parallel time integration (Q2568622)

Peer two-step \(W\)-methods are designed for integration of stiff initial value problems with parallelism across the method. The essential feature is that in each time step \(s\) `peer' approximations are employed having similar properties. In fact, no primary solution variable is distinguished. Parallel implementation of these stages is easy since information from one previous time step is used only and the different linear systems may be solved simultaneously. This paper introduces a subclass having order \(s-1\) where optimal damping for stiff problems is obtained by using different system parameters in different stages. Favourable properties of this subclass are uniform stability for realistic stepsize sequences and a superconvergence property which is proved using a polynomial collocation formulation. Numerical tests on a shared memory computer of a matrix-free implementation with Krylov methods are included.