Toward efficient unstructured multigrid preprocessing (extended abstract)

Abstract

The multigrid method is a general and powerful means of accelerating the convergence of discrete iterative methods for solving partial differential equations (PDEs) and similar problems. The adaptation of the multigrid method to unstructured meshes is important in the solution of problems with complex geometries. Unfortunately, multigrid schemes on unstructured meshes require significantly more preprocessing than on structured meshes. In fact, preprocessing can be a major part of the solution task, and for many applications, must be done repeatedly. In addition, the large computational requirements of realistic PDEs, accurately discretized on unstructured meshes, make such computations candidates for parallel or distributed processing, adding problem partitioning as a preprocessing task.

We report on a project to apply ideas from graph theory and geometry to the solution of the preprocessing tasks required for the parallel implementation of unstructured multigrid methods. Our objective is to provide conceptually simple, efficient, and unified methods. In a previous conference paper, we proposed two bottom-up, graph-based methods and one top-down method. In this paper, we report on several sets of experiments designed to explore the practical aspects of one of the methods, based on independent dominating sets. The experiments studied the empirical properties of the mesh hierarchies generated by the method and the numerical performance of the multigrid method solving Laplace's equation using these mesh hierachies. The experiments also studied the domain partitions generated by the method. Our conclusion based on these preliminary experiments is that our simple, automatic methods provide excellent multigrid performance at low preprocessing cost.

Research at Princeton University partially supported by the National Science Foundation, Grant No. CCR-8920505, and the Office of Naval Research, Contract No. N0014-91-J-1463.