In this paper, we propose a linear multistep method of order 5 that is self-starting for the direct solution of the general second-order initial value problem (IVP). The method is derived by the interpolation and collocation of the assumed approximate solution and its second derivative at x=x _n+j , j=1, 2, …, r−1, and x=x _n+j , j=1, 2, …, s−1, respectively, where r and s are the number of interpolation and collocation points, respectively. The interpolation and collocation procedures lead to a system of (r+s) equations involving (r+s) unknown coefficients, which are determined by the matrix inversion approach. The resulting coefficients are used to construct the approximate solution from which multiple finite difference methods (MFDMs) are obtained and simultaneously applied to provide a direct solution to IVPs. In particular, the method is implemented without the need for either predictors or starting values from other methods. Numerical examples are given to illustrate the efficiency of the method.

This paper concerns the numerical approximation of Fractional Initial Value Problems (FIVPs). This is achieved by constructing k-step continuous BDFs. These continuous schemes are developed via the interpolation and collocation approach and are used to obtain the discrete k-step BDF and (k-1) additional methods which are applied as numerical integrators in a block-by-block mode for the integration of FIVP. The properties of the methods are established and regions of absolute stability of the methods are plotted in the complex plane. Numerical tests including large systems arising form the semidiscretization of one-dimensional fractional Burger’s equation show that the methods are highly accurate and efficient.