On the relations between B\(_2\)VMs and Runge-Kutta collocation methods (Q2389534): Difference between revisions

The authors recall first in some details the construction of boundary value methods (BVMs) over an assigned nonuniform partition of the integration interval \([t_0, T]\) of the initial value problem and then the block versions of BVMs (B\(_2\)VMs for short) where \([t_0, T]\) is discretized by means of two different meshes: a coarser mesh which subdivides \([t_0, T]\) into contiguous subintervals and a finer mesh defined over each of them and composed of a fixed number of points. The aim is to make a systematic analysis of the existing connections between B\(_2\)VMs and Runge-Kutta (RK) collocation methods. The main result (Theorem 1) is that B\(_2\)VMs with minimal blocksize are equivalent to stiffy accurate RK collocation methods. Other possible choices for the finer mesh are presented and a possible extension of them for building B\(_2\)VMs with nonminimal blocksize is proposed, together with an example. The paper is interesting, concise and well written.