Analyzing scalability of parallel algorithms and architectures
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Average-case analyses of first fit and random fit bin packing
Random Structures & Algorithms
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Pursuing scalability for hypre's conceptual interfaces
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
A New Approach to Simulating Flow in Discrete Fracture Networks with an Optimized Mesh
SIAM Journal on Scientific Computing
An assumed partition algorithm for determining processor inter-communication
Parallel Computing
| Hi-index | 0.00 |
The high advanced techniques in parallel computing can be employed for a better understanding of groundwater flow fluids. Generally, the geological media are very heterogeneous and contain complex structures. Decomposing these structures into, approximately, equivalent sub-structures for a load-balancing is a major challenge. This paper proposes and analyses a new algorithm to simulate parallel flow fluid in such complex media. Fully parallel software is developed, and two well-known sparse linear solvers, based respectively on a multifrontal Cholesky factorization and an iterative structured multigrid method, are compared. The mixed finite element (MFE) method is used to discretize Darcy's equation. Numerical examples are presented to show the efficiency and robustness of the algorithm proposed.