Comparative efficiencies of domain decompositions

Abstract We identify and compare two different classes of domain decomposition algorithms suitable for grid-based simulation programs, such as those commonly found in finite element and finite volume codes. The domain decomposition schemes are either, logical methods that only account for the connectedness of the grid, or physical methods that take account only of the spatial separation of grid points. We use Engineering Systems International's finite element PAM-CRASH code on a number of grids of varying size and complexity. The recursive spectral partitioning method (a logical method) is consistently better than all the other methods for small to medium sized grids, while the physical methods are marginally better for comparatively larger grid sizes.