Computational & Technology Resources
an online resource for computational,
engineering & technology publications
DEVELOPMENTS IN ANALYSIS AND DESIGN USING FINITE ELEMENT METHODS
Edited by: B.H.V. Topping and B. Kumar
A Hybrid Method for Finite Element Nodal Ordering
A. Kaveh and H.A. Rahimi Bondarabady
Iran University of Science and Technology, Tehran, Iran
A. Kaveh, H.A. Rahimi Bondarabady, "A Hybrid Method for Finite Element Nodal Ordering", in B.H.V. Topping, B. Kumar, (Editors), "Developments in Analysis and Design using Finite Element Methods", Civil-Comp Press, Edinburgh, UK, pp 25-31, 1999. doi:10.4203/ccp.59.1.4
Keywords: ordering, finite element meshes, graph theory, algebraic graph theory, sparsity, Laplacian, complementary Laplacian.
Nodal ordering for the formation of suitable patterns for stiffness matrices of finite element meshes are often performed using graph theory and algebraic graph theory. In this paper a hybrid method is presented employing the main features of each theory. In this method, vectors containing certain properties of graphs are taken as Ritz vectors, and using methods for constructing complementary Laplacian, a reduced eigenproblem is formed. The solution of this problem results in coefficients of the Ritz vectors, indicating the significance of each considered vector.
The present method uses the global properties of graphs in ordering, and the local properties are incorporated using algebraic graph theory. The main feature of this method is its capability of transforming a general eigenproblem into an efficient approach incorporating graph theory. Examples are included to illustrate the efficiency of the present method.
purchase the full-text of this paper (price £20)