Computational Technology Resources - CCP

Paper IV.5

Finite Element Nodal Ordering Methods

A. Kaveh and M. Malek-Zadeh

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

doi:10.4203/ccp.33.4.5

A. Kaveh, M. Malek-Zadeh, "Finite Element Nodal Ordering Methods", in B.H.V. Topping, (Editor), "Developments in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 141-147, 1995. doi:10.4203/ccp.33.4.5

Abstract

Graph theoretical algorithms are presented for finite element nodal ordering to reduce the bandwidth of their stiffness matrices. Five different graphs are defined for representing the connectivity of FE models, and the problem of finite element nodal ordering is transformed into that of a graph nodal ordering. The efficiency of these methods are compared through examples of 2 and 3 dimensional finite element models.

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 IV.5 Finite Element Nodal Ordering Methods A. Kaveh and M. Malek-Zadeh Iranian Academy of Science and Iran University of Science and Technology, Tehran, Iran doi:10.4203/ccp.33.4.5 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Kaveh, M. Malek-Zadeh, "Finite Element Nodal Ordering Methods", in B.H.V. Topping, (Editor), "Developments in Computational Techniques for Structural Engineering", Civil-Comp Press, Edinburgh, UK, pp 141-147, 1995. doi:10.4203/ccp.33.4.5 Abstract Graph theoretical algorithms are presented for finite element nodal ordering to reduce the bandwidth of their stiffness matrices. Five different graphs are defined for representing the connectivity of FE models, and the problem of finite element nodal ordering is transformed into that of a graph nodal ordering. The efficiency of these methods are compared through examples of 2 and 3 dimensional finite element models. 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