Construction of variable-stepsize multistep formulas
Mathematics of Computation
The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
VODE: a variable-coefficient ODE solver
SIAM Journal on Scientific and Statistical Computing
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Applied Numerical Mathematics
Adaptive time-stepping and computational stability
Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
Constant coefficient linear multistep methods with step density control
Journal of Computational and Applied Mathematics
Adaptive time-stepping and computational stability
Journal of Computational and Applied Mathematics - Special issue: International workshop on the technological aspects of mathematics
Hi-index | 0.00 |
Multistep methods are classically constructed by specially designed difference operators on an equidistant time grid. To make them practically useful, they have to be implemented by varying the step-size according to some error-control algorithm. It is well known how to extend Adams and BDF formulas to a variable step-size formulation. In this paper we present a collocation approach to construct variable step-size formulas. We make use of piecewise polynomials to show that every k-step method of order k + 1 has a variable step-size polynomial collocation formulation.