Computational Technology Resources - CCP

Paper II.2

A Graph-Theoretical Method for Decomposition in Finite Element Analysis

A. Kaveh and G.R. Roosta

Department of Civil Engineering, Iran University of Science and Technology, Tehran, Iran, Building and Housing Research Center, Tehran, Iran

doi:10.4203/ccp.20.2.2

purchase the full-text of this paper

A. Kaveh, G.R. Roosta, "A Graph-Theoretical Method for Decomposition in Finite Element Analysis", in B.H.V. Topping, M. Papadrakakis, (Editors), "Advances in Parallel and Vector Processing for Structural Mechanics", Civil-Comp Press, Edinburgh, UK, pp 35-42, 1994. doi:10.4203/ccp.20.2.2

Abstract

In this paper an efficient algorithm is designed for decomposition of finite element models, for use in parallel computing. In this algorithm simple concepts of graph theory are employed to partition the FE model into subdomains with approximately equal number of degrees of freedom, while keeping the interface nodes to the smallest possible. Examples are included to illustrate the efficiency of the presented algorithm.

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 £60 +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: 20 ADVANCES IN PARALLEL AND VECTOR PROCESSING FOR STRUCTURAL MECHANICS Edited by: B.H.V. Topping and M. Papadrakakis Paper II.2 A Graph-Theoretical Method for Decomposition in Finite Element Analysis A. Kaveh and G.R. Roosta Department of Civil Engineering, Iran University of Science and Technology, Tehran, Iran, Building and Housing Research Center, Tehran, Iran doi:10.4203/ccp.20.2.2 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosta, "A Graph-Theoretical Method for Decomposition in Finite Element Analysis", in B.H.V. Topping, M. Papadrakakis, (Editors), "Advances in Parallel and Vector Processing for Structural Mechanics", Civil-Comp Press, Edinburgh, UK, pp 35-42, 1994. doi:10.4203/ccp.20.2.2 Abstract In this paper an efficient algorithm is designed for decomposition of finite element models, for use in parallel computing. In this algorithm simple concepts of graph theory are employed to partition the FE model into subdomains with approximately equal number of degrees of freedom, while keeping the interface nodes to the smallest possible. Examples are included to illustrate the efficiency of the presented algorithm. 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 £60 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions