A finite element nodal ordering with algebraic graph theory

被引:0
|
作者
Jing G. [1 ]
Chen D. [1 ]
机构
[1] Department of Bridge Engineering, Tongji University
来源
Tongji Daxue Xuebao/Journal of Tongji University | 2010年 / 38卷 / 06期
关键词
Algebraic graph theory; Bandwidth and profile of matrix; Finite element; Nodal ordering;
D O I
10.3969/j.issn.0253-374x.2010.06.026
中图分类号
学科分类号
摘要
A new methodology is proposed for construction of weighted element clique graph (WECG) based on nodal degrees of freedom. The Fiedler vector of the Laplacian Matrix of WECG is used for reduction of the bandwidth and profile of stiffness matrix in finite element analysis. The present method is not only suitable for common finite element models, but also for models including different nodal degrees of freedom of element in number and usually leads to better results for the latter models compared with common methodology of algebraic graph theory based on Laplacian Matrix of element clique graph. A pre-processing routine based on the present method is embedded in a finite element program, which can reduce the generation task of finite element model without consideration of nodal ordering. The numerical experiments show that the present method is efficient.
引用
收藏
页码:929 / 934
页数:5
相关论文
共 13 条
  • [1] Kaveh A., Roosta G.R., Comparative study of finite element nodal ordering methods, Engineering Structures, 20, 1-2, (1998)
  • [2] Cuthill E., Mckee J., Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th National Conference, pp. 157-172, (1969)
  • [3] Kaveh A., Ordering for bandwidth reduction, Computers and Structures, 24, 3, (1986)
  • [4] Sloan S.W., Algorithm for profile and wavefront reduction of sparse matrices, International Journal for Numerical Methods In Engineering, 23, 2, (1986)
  • [5] Lai Y.C., Weingarten V.I., Eshraghi H., Matrix profile and wavefront reduction based on the graph theory and wavefront minimization, International Journal for Numerical Methods in Engineering, 39, 7, (1996)
  • [6] Kaveh A., Algebraic and topological graph theory for ordering, Zeitschrift für angewandte Mathematik und Mechanik, 71, 6, (1991)
  • [7] Paulino G.H., Menezes I., Gattass M., Et al., Node and element resequencing using the laplacian of a finite-element graph. 1. General concepts and algorithm, International Journal for Numerical Methods in Engineering, 37, 9, (1994)
  • [8] Kaveh A., Bondarabady H., A hybrid method for finite element ordering, Computers and Structures, 80, 3-4, (2002)
  • [9] Kaveh A., Rahimi Bondarabady H.A., A multi-level finite element nodal ordering using algebraic graph theory, Finite Elements in Analysis and Design, 38, 3, (2002)
  • [10] Fiedler M., Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23, (1973)