A new spectral method for nodal ordering of regular space structures

Authors:
A. Kaveh;H. Rahami
Affiliations:
Department of Civil Engineering Iran University of Science and Technology, Narmak, Tehran 16844, Iran;Department of Civil Engineering Iran University of Science and Technology, Narmak, Tehran 16844, Iran
Venue:
Finite Elements in Analysis and Design
Year:
2004

Citing 5
Cited 3

Transportation in graphs and the admittance spectrum

Discrete Applied Mathematics
A new algorithm for finding a pseudoperipheral node in a graph

SIAM Journal on Matrix Analysis and Applications
Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Graph theory and its applications

Graph theory and its applications
A multi-level finite element nodal ordering using algebraic graph theory

Finite Elements in Analysis and Design

Graph products for configuration processing of space structures

Computers and Structures
A general theorem for adjacency matrices of graph products and application in graph partitioning for parallel computing

Finite Elements in Analysis and Design
Factorization of product graphs for partitioning and domain decomposition

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.