A domain decomposition tool for boundary element methods

Domain decomposition boundary element methods have become increasingly popular over the last several years for a variety of reasons. In particular, these methods reduce the storage and CPU requirements, can result in sparse linear systems, are easy to parallelize, and, when used in conjunction with a dual reciprocity method, can significantly improve the conditioning of the associated linear system. Nevertheless, for complex geometries, determining an appropriate decomposition of the domain can be extremely difficult. A domain decomposition tool based on a graph partitioning algorithm is presented to automate the process and provide quality decompositions. (C) 2007 Elsevier Ltd. All rights reserved.