Computational Technology Resources - CCP

A. Kaveh* and H. Rahimi Bondarabady+

*Iran University of Science and Technology, Narmak, Tehran, Iran
+Tarbiat Modares University, Tehran, Iran

doi:10.4203/ccp.55.4.2

A. Kaveh, H. Rahimi Bondarabady, "Element Ordering for Frontwidth Optimization", in B.H.V. Topping, (Editor), "Advances in Computational Structural Mechanics", Civil-Comp Press, Edinburgh, UK, pp 77-84, 1998. doi:10.4203/ccp.55.4.2

Keywords: wavefront reduction, finite elements. graph theory, shortest route tree, Sloan's algorithm, ordering, sparse matrices.

Abstract

In this paper, ten different graphs are associated with finite element models for transforming the connectivity properties of such models into those of their graphs. The properties and special features of these graphs are presented, and employed in element ordering of the finite element models.

Algorithms are presented for wavefront reduction using the proposed graph models, and their efficiencies are compared through examples of different connectivity.

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 £95 +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: 55 ADVANCES IN COMPUTATIONAL STRUCTURAL MECHANICS Edited by: B.H.V. Topping Paper IV.2 Element Ordering for Frontwidth Optimization A. Kaveh* and H. Rahimi Bondarabady+ Iran University of Science and Technology, Narmak, Tehran, Iran +Tarbiat Modares University, Tehran, Iran doi:10.4203/ccp.55.4.2 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, H. Rahimi Bondarabady, "Element Ordering for Frontwidth Optimization", in B.H.V. Topping, (Editor), "Advances in Computational Structural Mechanics", Civil-Comp Press, Edinburgh, UK, pp 77-84, 1998. doi:10.4203/ccp.55.4.2 Keywords:* wavefront reduction, finite elements. graph theory, shortest route tree, Sloan's algorithm, ordering, sparse matrices. Abstract In this paper, ten different graphs are associated with finite element models for transforming the connectivity properties of such models into those of their graphs. The properties and special features of these graphs are presented, and employed in element ordering of the finite element models. Algorithms are presented for wavefront reduction using the proposed graph models, and their efficiencies are compared through examples of different connectivity. 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 £95 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions