Polynomial multipoint methods are a new class of time-stepping schemes for solving first-order ordinary differential equations. The method construction is inspired by spatial spectral methods and allows for arbitrarily high-orders of accuracy as well as parallelism across the method. Order, linear stability, and adaptive time-stepping implementation will be presented, as well as similarities with existing general linear methods.

1.
B.
Fornberg
,
A Practical Guide to Pseudospectral Methods
, Vol. 1 (
Cambridge University Press
,
1998
).
2.
L. N.
Trefethen
,
Approximation theory and approximation practice
(
SIAM
,
Philadelphia
,
2013
).
3.
L. N.
Trefethen
,
Spectral Methods in MATLAB
,
Vol. 10
(
SIAM
,
Philadelphia
,
2000
).
4.
J. P.
Boyd
,
Chebyshev and Fourier Spectral Methods
(
Dover
,
New York
,
2013
).
5.
J. C.
Butcher
,
Acta Numerica
15
,
157
256
(
2006
).
6.
J. C.
Butcher
,
Comp. Appl. Math
14
,
59
72
(
1995
).
7.
C. W.
Gear
,
Calcolo
25
,
1
20
(
1988
).
8.
J. C.
Butcher
,
Mathematics of Computation
20
,
1
10
(
1966
).
9.
J. C.
Butcher
,
Applied Numerical Mathematics
1
,
273
284
(
1985
).
This content is only available via PDF.
You do not currently have access to this content.