A platform for research: civil engineering, architecture and urbanism
Graph-theoretical Methods for Substructuring, Subdomaining and Ordering
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.
Graph-theoretical Methods for Substructuring, Subdomaining and Ordering
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.
Graph-theoretical Methods for Substructuring, Subdomaining and Ordering
Kaveh, A. (author) / Roosta, G.R. (author)
International Journal of Space Structures ; 10 ; 121-131
1995-06-01
11 pages
Article (Journal)
Electronic Resource
English
Graph-theoretical methods for substructuring and ordering
British Library Conference Proceedings | 1995
|Graph-Theoretical Methods for Substructuring, Subdomaining and Ordering
Online Contents | 1995
|Bond-graph based substructuring of dynamical systems
Online Contents | 2005
|Bond‐graph based substructuring of dynamical systems
Wiley | 2005
|Methods of substructuring in lake circulation dynamics
British Library Online Contents | 2000
|