An analysis of linear multistep methods

The algebraic and analytic properties of the characteristic function of a linear multistep method are analyzed to provide an upper bound on the step size of a method. The step size may be chosen such that the zeros of a certain polynomial have moduli less than one. The convergence of a linear multistep method depends on a relationship between the order and the step number of the method and the location of the zeros of a certain polynomial.