A new spectral method for nodal ordering of regular space structures

In this article, an efficient method for calculating the eigenvalues of space structures with regular topologies is presented. In this method, the topology of a structure is formed as the Cartesian product of its generators, and the eigenvalues of the adjacency and Laplacian matrices for their graph models are easily calculated using the eigenvalues of their generators. A fast method is also proposed for computing the second eigenvalue of the Laplacian of a graph known as the Fiedler vector, which is used for nodal ordering of space structures, leading to well-structured stiffness matrices.

[1]  Hoshyar Nooshin Formex configuration processing in structural engineering , 1984 .

[2]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[3]  N. Biggs Algebraic Graph Theory , 1974 .

[4]  Ali Kaveh,et al.  Spectral trisection of finite element models , 2001 .

[5]  R. Grimes,et al.  A new algorithm for finding a pseudoperipheral node in a graph , 1990 .

[6]  Ali Kaveh,et al.  Optimal Structural Analysis , 1997 .

[7]  Ali Kaveh,et al.  Structural Mechanics: Graph and Matrix Methods , 1995 .

[8]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[9]  Ali Kaveh,et al.  Spectral bisection of adaptive finite element meshes for parallel processing , 1999 .

[10]  Marcelo Gattass,et al.  Node and element resequencing using the laplacian of a finite element graph: part i---general concep , 1994 .

[11]  P. D. Straffing LINEAR ALGEBRA IN GEOGRAPHY, EIGENVECTORS OF NETWORKS , 1980 .

[12]  B. Mohar THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[13]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[14]  J. Gross,et al.  Graph Theory and Its Applications , 1998 .

[15]  P. Gould THE GEOGRAPHICAL INTERPRETATION OF EIGENVALUES , 1967 .

[16]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[17]  D. West Introduction to Graph Theory , 1995 .

[18]  A. Kaveh ALGEBRAIC AND TOPOLOGICAL GRAPH THEORY FOR ORDERING , 1991 .

[19]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[20]  Ali Kaveh,et al.  A multi-level finite element nodal ordering using algebraic graph theory , 2001 .

[21]  Christoph Maas,et al.  Transportation in graphs and the admittance spectrum , 1987, Discret. Appl. Math..