In this work we present a subdomain partitioning strategy applied to an explicit high-resolution Euler solver. We describe the design The subdomain partitioning strategy adopted in this of a portable parallel multi-domain code suitable for parallel enviwork is a special case of the more general mul
Parallel implementation of fast elliptic solver
โ Scribed by Svetozara Petrova
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 927 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
A fast elliptic solver for separable elliptic equations on rectangular domains is considered. The method is referred to as FASV (fast algorithm for separation of variables) and is based on the odd-even block elimination technique in combination with the method for discrete separation of variables. The algorithm is connected with solving systems of algebraic equations with sparsity whose right-hand sides have only a few nonzero block components. The method is effective and stable by construction. Only a few of the block solution components are needed and hence these problems might be solved incompletely. Parallel implementation of the method proposed using the public domain PVM software is described in terms of decomposition of the original rectangular domain into a number of strips. Numerical results for a model problem on a cluster of a few IBM workstations are reported.
๐ SIMILAR VOLUMES
portable parallel flow solver package for multiple applications. In terms of efficiency, we want the solver to have The development and applications of a parallel, time-dependent incompressible Navier-Stokes flow solver and a parallel multigrid high numerical efficiency, as well as parallel computi
We have developed a fast direct solver for parallel solution of coarse grid problems, Ax=b, such as arise when domain decomposition or multigrid methods are applied to elliptic partial differential equations in d space dimensions. The approach is based on a (quasi-) sparse factorization of the inver