Optimal order multistep methods with an arbitrary number of nonsteppoints
In this paper optimal order, k-step methods with one nonstep point for the numerical solution of y' = f(x,y) y(a) = n, introduced by Gragg and Stetter (1) are extended to an arbitrary number s of nonstep points. These methods have order 2k + 2s, are proved stable for k ≤ 8, s ≥ 2, and not stable for large k.
Unable to display preview. Download preview PDF.
- 3.Marden, M., Geometry of polynomials. American mathematical society, Providence, Rhode Island, 1966.Google Scholar