Multilevel diffusion schemes for repartitioning of adaptive meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes
IEEE Transactions on Parallel and Distributed Systems
AGGLOMERATION MULTIGRID FOR THE THREE-DIMENSIONAL EULER EQUATIONS
AGGLOMERATION MULTIGRID FOR THE THREE-DIMENSIONAL EULER EQUATIONS
Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver
Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver
Large-scale parallel unstructured mesh computations for 3D high-lift analysis
Large-scale parallel unstructured mesh computations for 3D high-lift analysis
Feature-Space Analysis of Unstructured Meshes
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Irregularity handling via structured parallel programming
International Journal of Computational Science and Engineering
On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
Journal of Computational Physics
Hi-index | 0.00 |
Geometric Multigrid methods have gained widespread acceptance for solving large systems of linear equations, especially for structured grids. One of the challenges in successfully extending these methods to unstructured grids is the problem of generating an appropriate set of coarse grids. The focus of this paper is the development of robust algorithms, both serial and parallel, for generating a sequence of coarse grids from the original unstructured grid. Our algorithms treat the problem of coarse grid construction as an optimization problem that tries to optimize the overall quality of the resulting fused elements. We solve this problem using the multilevel paradigm that has been very successful in solving the related grid/graph partitioning problem. The parallel formulation of our algorithm incurs a very small communication overhead, achieves high degree of concurrency, and maintains the high quality of the coarse grids obtained by the serial algorithm.