A class of explicit parallel two-step Runge-Kutta methods

DSpace/Manakin Repository

A class of explicit parallel two-step Runge-Kutta methods

Show simple item record


dc.contributor.author Cong, N.H.
dc.contributor.author Mitsui, T.
dc.date.accessioned 2011-05-06T01:45:17Z
dc.date.available 2011-05-06T01:45:17Z
dc.date.issued 1997
dc.identifier.citation Volume: 14 Issue: 2 Page : 303-313 vi
dc.identifier.issn 9167005
dc.identifier.uri http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6726
dc.description.abstract The aim of the present paper is to construct a class of two-step Runge-Kutta methods of arbitrarily high order for application to parallel computers. Starting with an s-stage implicit two-step Runge-Kutta method of order p with k = p/2 implicit stages, we apply the highly parallel predictor-corrector iteration process in P(EC)mE mode. In this way, we obtain an explicit two-step Runge-Kutta method that has order p for all m and that requires k(m + 1) right-hand side evaluations per step of which each k evaluation can be computed in parallel. By a number of numerical experiments we show the superiority of the parallel predictor-corrector methods proposed here over parallel methods available in the literature. vi
dc.language.iso en vi
dc.publisher Japan Journal of Industrial and Applied Mathematics vi
dc.subject Parallelism vi
dc.subject Predictor-corrector methods vi
dc.subject Runge-Kutta methods vi
dc.title A class of explicit parallel two-step Runge-Kutta methods vi
dc.type Article vi

Files in this item

Files Size Format View
1016.pdf 45.35Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account