Abstract
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 + I has a variable step-size polynomial collocation formulation. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 5-16 |
| Journal | Applied Numerical Mathematics |
| Volume | 42 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 2002 |
Bibliographical note
The information about affiliations in this record was updated in December 2015.The record was previously connected to the following departments: Numerical Analysis (011015004)
Subject classification (UKÄ)
- Mathematical Sciences
Free keywords
- step-size formulas
- variable
- ordinary differential equations (ODEs)
- multistep methods
- collocation