Computational Technology Resources - CCP

Paper VII.8

An Algorithm for Partitioning of Finite Element Meshes

A. Kaveh* and G.R. Roosta#

*Iran University of Science and Technology, Tehran, Iran
#Building and Housing Research Centre, Tehran, Iran

doi:10.4203/ccp.38.7.8

A. Kaveh, G.R. Roosta, "An Algorithm for Partitioning of Finite Element Meshes", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 289-296, 1996. doi:10.4203/ccp.38.7.8

Abstract

An efficient algorithm is developed for partitioning of unstructured finite element meshes. A new graph model is presented and employed for transforming the connectivity properties of meshes. This method leads to a load balance partitioning in which the number of interface nodes are confined to the smallest possible, and aspect ratios of subdomains are desired values. Examples are included to illustrate the performance and efficiency of the presented method.

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 £82 +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: 38 ADVANCES IN COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping Paper VII.8 An Algorithm for Partitioning of Finite Element Meshes A. Kaveh* and G.R. Roosta# *Iran University of Science and Technology, Tehran, Iran #Building and Housing Research Centre, Tehran, Iran doi:10.4203/ccp.38.7.8 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, G.R. Roosta, "An Algorithm for Partitioning of Finite Element Meshes", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 289-296, 1996. doi:10.4203/ccp.38.7.8 Abstract An efficient algorithm is developed for partitioning of unstructured finite element meshes. A new graph model is presented and employed for transforming the connectivity properties of meshes. This method leads to a load balance partitioning in which the number of interface nodes are confined to the smallest possible, and aspect ratios of subdomains are desired values. Examples are included to illustrate the performance and efficiency of the presented method. 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 £82 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions