Computational Technology Resources - CCP

Paper II.6

Substructuring for the Combinatorial Force Method of Structural Analysis

A. Kaveh, G.R. Roosts and A. Mokhtar-Zadeh

Iranian Academy of Science and Iran University of Science and Technology, Tehran, Iran

doi:10.4203/ccp.33.2.6

A. Kaveh, G.R. Roosts, A. Mokhtar-Zadeh, "Substructuring for the Combinatorial Force Method of Structural Analysis", in B.H.V. Topping, (Editor), "Developments in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 53-60, 1995. doi:10.4203/ccp.33.2.6

Abstract

In this paper an efficient algorithm is designed for substructuring, for use in parallel computing, employing simple concepts of graph theory. This algorithm partitions the graph model of a structure into subgraphs with equal or nearly equal first Betti numbers, while keeping the interface nodes to the smallest possible. The complete formulation of the force method is provided and examples are included to illustrate the decomposition method presented.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £78 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 33 DEVELOPMENTS IN COMPUTATIONAL TECHNIQUES FOR STRUCTURAL ENGINEERING Edited by: B.H.V. Topping Paper II.6 Substructuring for the Combinatorial Force Method of Structural Analysis A. Kaveh, G.R. Roosts and A. Mokhtar-Zadeh Iranian Academy of Science and Iran University of Science and Technology, Tehran, Iran doi:10.4203/ccp.33.2.6 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosts, A. Mokhtar-Zadeh, "Substructuring for the Combinatorial Force Method of Structural Analysis", in B.H.V. Topping, (Editor), "Developments in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 53-60, 1995. doi:10.4203/ccp.33.2.6 Abstract In this paper an efficient algorithm is designed for substructuring, for use in parallel computing, employing simple concepts of graph theory. This algorithm partitions the graph model of a structure into subgraphs with equal or nearly equal first Betti numbers, while keeping the interface nodes to the smallest possible. The complete formulation of the force method is provided and examples are included to illustrate the decomposition method presented. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £78 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions