𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Limits of parallelism in explicit ODE methods

✍ Scribed by Robert D. Skeel; Hon-Wah Tam

Publisher
Springer US
Year
1992
Tongue
English
Weight
589 KB
Volume
2
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combination method for parallel computat
Combination method for parallel computation in ODE
✍ Xiaoqiu Song; Yuan Zhaoding; Degui Liu πŸ“‚ Article πŸ“… 1993 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 213 KB
Parallel implementation of block boundar
Parallel implementation of block boundary value methods for ODEs
✍ Pierluigi Amodio; Luigi Brugnano πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 720 KB

The parallel solution of initial value problems for ODEs has been the subject of much research in the last thirty years, and different approaches to the problem have been devised. In this paper we examine the parallel methods derived by block boundary value methods (BVMs), recently introduced for ap

Parallel computation of meshless methods
Parallel computation of meshless methods for explicit dynamic analysis
✍ Kent T. Danielson; Su Hao; Wing Kam Liu; R. Aziz Uras; Shoafan Li πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 386 KB πŸ‘ 3 views

A parallel computational implementation of modern meshless methods is presented for explicit dynamic analysis. The procedures are demonstrated by application of the Reproducing Kernel Particle Method (RKPM). Aspects of a coarse grain parallel paradigm are detailed for a Lagrangian formulation using

Data communication in parallel block pre
Data communication in parallel block predictor-corrector methods for solving ODE's
✍ P.S. Rao; G. Mouney πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 856 KB

In the present article we have considered the problem of data communication in parallel block predictor-corrector (P-BPC) methods for solving ODE's using only time as well as time and space discretizations for systems of equations. After presenting task graphs for each of these discretizations, we p