Computable explicit bounds for the discretization error of variable stepsize multistep methods (Q1569972)

In a variable stepsize multistep method the coefficients of the method depend on the mesh-size ratios of adjacent steps. In the uniform case all these ratios are equal to one and the stability of the methods is well-understood with the aid of Dahlquist's root condition for the characteristic polynomial. The authors consider multistep methods on such variable grids that can be regarded as a small perturbation of uniform grids, i.e. with mesh-size ratios close to one. It is known that the methods remain to be stable if the perturbation is sufficiently small, a proof is also given in the paper. The authors focus on a computable explicit bound for the error in terms of the given data. As already in the uniform case the obtained exponential type bound is unrealistically large in almost all practical cases.