Sammanfattning
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.
| Originalspråk | engelska |
|---|---|
| Sidor (från-till) | 5-16 |
| Tidskrift | Applied Numerical Mathematics |
| Volym | 42 |
| Nummer | 1-3 |
| DOI | |
| Status | Published - 2002 |
Bibliografisk information
The information about affiliations in this record was updated in December 2015.The record was previously connected to the following departments: Numerical Analysis (011015004)
Ämnesklassifikation (UKÄ)
- Matematik