Mesh partitioning algorithms for the parallel solution of partial differential equations (Q685976): Difference between revisions

In the recent years a number of algorithms based on domain decomposition methods has been proposed for the solution of partial differential equations arising, among others, in solid and fluid mechanics problems. Generally, these methods are spurred by the advent of parallel processors and are motivated by the fact that domain decomposition provides a natural route to parallelism by the ``divide and conquer'' paradigm. For these methods which also require grids of points or patches of elements, it is often necessary to partition explicitly the underlying mesh, especially when working with local memory parallel processors. In the present paper a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes is presented and discussed in view of a domain-decomposed solution and parallel processing.