Certain symmetric linear multistep methods have an excellent long-time behavior when applied to second order Hamiltonian systems with or without constraints. For high accuracy computations round-off can be the dominating source of errors. This article shows how symmetric multistep methods should be implemented, so that round-off errors are minimized and propagate like a random walk.

Long-time integration of Hamiltonian systems is an important issue in many applications – for example the planetary motion in astronomy or simulations in molecular dynamics. Symplectic and symmetric one-step methods are known to have favorable numerical features like near energy preservation over long times and at most linear error growth for nearly integrable systems. This work studies the sui...

A new two-step implicit linear Obrechkoff twelfth algebraic order method with vanished phase-lag and its first, second, third and fourth derivatives is constructed in this paper. The purpose of this paper is to develop an efficient algorithm for the approximate solution of the one-dimensional radial Schrodinger equation and related problems. This algorithm belongs in the category of the multist...

All of the numerical methods that we have developed for solving initial value problems are onestep methods, because they only use information about the solution at time tn to approximate the solution at time tn+1. As n increases, that means that there are additional values of the solution, at previous times, that could be helpful, but are unused. Multistep methods are time-stepping methods that...

The approximation of y=Ay + B't)y +c(t) by linear multistep methods is studied. It is supposed that the matrix A is real symmetric and negative semidefinite, that the multistep method has an interval of absolute stability [—s, 0], and that h2 II A II < s where h is the time step. A priori error bounds are derived which show that the exponential multiplication factor is of the formexp{r;i||B|||„...

In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...