Decomposition for Parallel Computing: Graph Theory Methods

Computational Structural Analysis and Finite Element Methods ◽

10.1007/978-3-319-02964-1_8 ◽

2013 ◽

pp. 341-376 ◽

Cited By ~ 1

Author(s):

A. Kaveh

Keyword(s):

Parallel Computing ◽

Graph Theory

Download Full-text

Towards product-level parallel computing of large-scale building information modeling data using graph theory

Building and Environment ◽

10.1016/j.buildenv.2019.106558 ◽

2020 ◽

Vol 169 ◽

pp. 106558 ◽

Cited By ~ 2

Author(s):

Xiaoping Zhou ◽

Jichao Zhao ◽

Jia Wang ◽

Ming Guo ◽

Jiayin Liu ◽

...

Keyword(s):

Parallel Computing ◽

Graph Theory ◽

Large Scale ◽

Building Information Modeling ◽

Information Modeling ◽

Product Level ◽

Building Information ◽

Modeling Data

Download Full-text

Graph-theoretical Methods for Substructuring, Subdomaining and Ordering

International Journal of Space Structures ◽

10.1177/026635119501000205 ◽

1995 ◽

Vol 10 (2) ◽

pp. 121-131 ◽

Cited By ~ 6

Author(s):

A. Kaveh ◽

G.R. Roosta

Keyword(s):

Finite Element ◽

Parallel Computing ◽

Graph Theory ◽

Finite Element Model ◽

Graph Model ◽

Simple Algorithm ◽

Element Model ◽

Efficient Algorithms ◽

Theoretical Methods

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.

Download Full-text