Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Superconvergence for multistep collocation


Authors: Ivar Lie and Syvert P. Nørsett
Journal: Math. Comp. 52 (1989), 65-79
MSC: Primary 65L05
MathSciNet review: 971403
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: One-step collocation methods are known to be a subclass of implicit Runge-Kutta methods. Further, one-leg methods are special multistep one-point collocation methods. In this paper we extend both of these collocation ideas to multistep collocation methods with k previous meshpoints and m collocation points. By construction, the order is at least $ m + k - 1$. However, by choosing the collocation points in the right way, order $ 2m + k - 1$ is obtained as the maximum. There are $ \left( {\begin{array}{*{20}{c}} {m + k - 1} \\ {k - 1} \\ \end{array} } \right)$ sets of such "multistep Gaussian" collocation points.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65L05

Retrieve articles in all journals with MSC: 65L05


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1989-0971403-5
PII: S 0025-5718(1989)0971403-5
Article copyright: © Copyright 1989 American Mathematical Society