A general class of explicit pseudo two-step RKN methods on parallel computers

DSpace/Manakin Repository

A general class of explicit pseudo two-step RKN methods on parallel computers

Show simple item record


dc.contributor.author Gong, N.H.
dc.contributor.author Strehmel, K.
dc.contributor.author Weiner, R.
dc.date.accessioned 2011-05-04T09:34:20Z
dc.date.available 2011-05-04T09:34:20Z
dc.date.issued 1999
dc.identifier.citation Computers and Mathematics with Applications vi
dc.identifier.issn 8981221
dc.identifier.uri http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6532
dc.description.abstract The aim of this paper is to investigate a general class of explicit pseudo two-step Runge-Kutta- Nystr??m methods (RKN methods) of arbitrarily high order for nonstiff problems for systems of special second-order differential equations y??(t) = f(y(t)). Order and stability considerations show that we can obtain for any given p, a stable pth-order explicit pseudo two-step RKN method requiring p - 2 right-hand side evaluations per step of which each evaluation can be obtained in parallel. Consequently, on a multiprocessor computer, only one sequential right-hand side evaluation per step is required. By a few widely-used test problems, we show the superiority of the methods considered in this paper over both sequential and parallel methods available in the literature. ?? 1999 Elsevier Science Ltd. All rights reserved. vi
dc.language.iso en vi
dc.publisher Scopus vi
dc.relation.ispartofseries Volume: 38 Issue: 6-May Page : 17-30;
dc.subject Parallelism vi
dc.subject Stability vi
dc.title A general class of explicit pseudo two-step RKN methods on parallel computers vi
dc.type Article vi

Files in this item

Files Size Format View
962.pdf 48.27Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account