hrcak mascot   Srce   HID

Journal of computing and information technology, Vol. 8 No. 1, 2000.

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2000.01.02

High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers

Jorg Wensch
Rudiger Weiner
Helmut Podhaisky

Puni tekst: engleski, pdf (199 KB) str. 13-18 preuzimanja: 510* citiraj
APA 6th Edition
Wensch, J., Weiner, R. i Podhaisky, H. (2000). High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers. Journal of computing and information technology, 8 (1), 13-18. https://doi.org/10.2498/cit.2000.01.02
MLA 8th Edition
Wensch, Jorg, et al. "High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers." Journal of computing and information technology, vol. 8, br. 1, 2000, str. 13-18. https://doi.org/10.2498/cit.2000.01.02. Citirano 26.02.2021.
Chicago 17th Edition
Wensch, Jorg, Rudiger Weiner i Helmut Podhaisky. "High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers." Journal of computing and information technology 8, br. 1 (2000): 13-18. https://doi.org/10.2498/cit.2000.01.02
Harvard
Wensch, J., Weiner, R., i Podhaisky, H. (2000). 'High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers', Journal of computing and information technology, 8(1), str. 13-18. https://doi.org/10.2498/cit.2000.01.02
Vancouver
Wensch J, Weiner R, Podhaisky H. High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers. Journal of computing and information technology [Internet]. 2000 [pristupljeno 26.02.2021.];8(1):13-18. https://doi.org/10.2498/cit.2000.01.02
IEEE
J. Wensch, R. Weiner i H. Podhaisky, "High Order Explicit Two-Step Runge-Kutta Methods for Parallel Computers", Journal of computing and information technology, vol.8, br. 1, str. 13-18, 2000. [Online]. https://doi.org/10.2498/cit.2000.01.02

Sažetak
In this paper we study a class of explicit pseudo two-step Runge-Kutta methods (EPTRK methods) with additional weights v. These methods are especially designed for parallel computers. We study s-stage methods with local stage order s and local step order s + 2 and derive a sufficient condition for global convergence order s + 2 for fixed step sizes. Numerical experiments with 4- and 5-stage methods show the influence of this superconvergence condition. However, in general it is not possible to employ the new introduced weights to improve the stability of high order methods. We show, for any given s-stage method with extended weights which fulfills the simplifying conditions B(s) and C(s - 1), the existence of a reduced method with a simple weight vector which has the same linear stability behaviour and the same order.

Hrčak ID: 44848

URI
https://hrcak.srce.hr/44848

Posjeta: 670 *