We present a new class of explicit two-step peer methods for the solution of nonstiff differential systems. A construction principle for methods of order p = s, s the number of stages, with optimal zero-stability is given. Two methods of order p = 6, found by numerical search, are tested in Matlab o
Superconvergent explicit two-step peer methods
✍ Scribed by Rüdiger Weiner; Bernhard A. Schmitt; Helmut Podhaisky; Stefan Jebens
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 817 KB
- Volume
- 223
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
We consider explicit two-step peer methods for the solution of nonstiff differential systems. By an additional condition a subclass of optimally zero-stable methods is identified that is superconvergent of order p = s + 1, where s is the number of stages. The new condition allows us to reduce the number of coefficients in a numerical search for good methods. We present methods with 4-7 stages which are tested in FORTRAN90 and compared with DOPRI5 and DOP853. The results confirm the high potential of the new class of methods.
📜 SIMILAR VOLUMES
The aim of this paper is to apply a class of constant stepsize explicit pseudo two-step Runge-Kutta methods of arbitrarily high order to nonstiff problems for systems of first-order differential equations with variable stepsize strategy. Embedded formulas are provided for giving a cheap error estima
we present a new type of method for the integration of systems of linear inhomogeneous initial value problems with constant coefficients. Our methods are of hybrid explicit Numerov type. The methods are constructed without the intermediate use of high accuracy interpolatory nodes, since only the Tay