Abstract
In the paper we present a new family of one-step methods. These methods are of the Runge-Kutta type. However, they have only explicit internal stages that leads to a cheap practical implementation. On the other hand, the new methods are of classical order 4 and stage order 2 or 3. They are A-stable and symmetric. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kulikov, G. Y., & Shindin, S. K. (2006). On a family of cheap symmetric one-step methods of order four. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 781–785). Springer Verlag. https://doi.org/10.1007/11758501_104
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
