An algorithm for domain decomposition in finite element analysis

A simple and efficient algorithm is described for automatic decomposition of an arbitrary finite element domain into a specified number of subdomains for finite element and substructuring analysis in a multiprocessor computer environment. The algorithm is designed to balance the work loads, to minimize the communication among processors and to minimize the bandwidths of the resulting system of equations. Small- to large-scale finite element models, which have two-node elements (truss, beam element), three-node elements (triangular element) and four-node elements (quadrilateral element), are solved on the Convex computer to illustrate the effectiveness of the proposed algorithm. A FORTRAN computer program is also included.