Straightforward partitioning of composite grids for explicit difference methods
✍ Scribed by Michael Thuné
- Book ID
- 104304344
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 434 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
Thunr, M., Straightforward partitioning of composite grids for explicit difference methods, Parallel Computing 17 (1991) 665-672.
A straightforward partitioning strategy is analyzed for the case of explicit difference methods on composite grids. The computer is assumed to be of MIMD type with distributed memory. The amount of computational work at the boundary points is assumed to differ from that at the interior points. Theoretical estimates of the efficiency show that the straightforward strategy will be sufficiently efficient for problems with a relatively small work load at the boundary points, a modest number of processors, and close to square grids. For problems that are far from having these properties, a more sophisticated partitioning strategy is needed.
📜 SIMILAR VOLUMES
## Abstract We consider the numerical solution of a model one‐dimensional diffusion‐convection equation by a variety of explicit finite difference methods including conventional central and upwind replacements of the convection terms. We discuss commonly observed phenomena such as instability, unwa