P-stability is an important requirement in the numerical in- tegration of stiff oscillatory systems, but this desirable feature is not pos sessed by any class of numerical methods for y″ = f(x, y). It is known, for example, that P-stable linear mnultistep methods have maximum or- der two and symmetric one step polynomial collocation methods can't be P-stab1e (Coleman 1992). In this note we show the existence of P- stable methods within a general class of two step Runge-Kutta-Nytröm methods. © Springer-Verlag 2002.
CITATION STYLE
Paternoster, B. (2002). Two step Runge-Kutta-Nyström methods for y″ = f(x, y) and P-stability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2331 LNCS, pp. 459–466). Springer Verlag. https://doi.org/10.1007/3-540-47789-6_48
Mendeley helps you to discover research relevant for your work.