In this paper efficient algorithms are designed for substructuring and subdomaining for use in parallel computing, employing simple concepts of graph theory. The algorithms developed partitions the graph model of a structure (or a finite element model) into subgraphs (subdomains) with equal or nearly equal number of internal nodes, while keeping the interface nodes to the smallest possible. Further refinement of the selected substructures (subdomains) are also made by recursive application of the algorithms. A simple algorithm is also presented for nodal ordering.
Get full access to this article
View all access options for this article.
References
1.
WhiteheadJ.H.C., Simplicial Spaces, Nuclei and m-groups, Proc. Lond. Soc., Vol. 45, 1939, 243-327.
2.
KavehA., Application of Topology and Matroid Theory to the Analysis of Structures, Ph.D. Thesis, London University, Imperial College, 1974.
3.
KronG., Solving Complex Elastic Structures in Easy Stages, J. Appl. Mech., Vol. 22, 1955, 235-244.
4.
RothJ.P., An Application of Algebraic Topology: Kron's Method of Tearing, Quart, Appl. Math., Vol. 17, 1959, 1-23.
5.
NoorA.K., KamelH.A.and FultonR.E., Substructuring Technique – Status and Projections, Comput. Struct., Vol. 8, 1978, 621-632.
6.
SpillersW.R., Application of Topology in Structural Analysis, ASCE, Struct, Div., Vol. 89, 1963, 301-313.
7.
GeorgeA., Nested Dissection of a Regular Finite Element Mesh, SIAM J. Numer. Anal., Vol. 10, 1973, 345-363.
8.
GeorgeA. and LiuJ.W.H., Algorithms for Partitioning and Numerical Solution of Finite Element Systems, SIAM J. Numer, Anal. Vol. 15, 1978, 297-327.
9.
GeorgeA., Solution of Linear System of Equations; Direct Methods for Finite Element Problems, Lect. Notes Math., Edits A. Dold and E. Eckmann, Springer Verlag, Vol. 572, 1977, 52-101.
