An efficient method for decomposition of regular structures using graph products
- 21 September 2004
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 61 (11) , 1797-1808
Abstract
In this paper an efficient method is presented for calculating the eigenvalues of regular structural models. A structural model is calledregularif they can be viewed as the direct or strong Cartesian product of some simple graphs known as theirgenerators. The eigenvalues of the adjacency and Laplacian matrices for a regular graph model are easily obtained by the evaluation of eigenvalues of its generators. The second eigenvalue of the Laplacian of a graph is also obtained using a much faster and much simple approach than the existing methods. Copyright © 2004 John Wiley & Sons, Ltd.Keywords
This publication has 14 references indexed in Scilit:
- A new spectral method for nodal ordering of regular space structuresFinite Elements in Analysis and Design, 2004
- A multi-level finite element nodal ordering using algebraic graph theoryFinite Elements in Analysis and Design, 2002
- Spectral bisection of adaptive finite element meshes for parallel processingComputers & Structures, 1999
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithmInternational Journal for Numerical Methods in Engineering, 1994
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A New Algorithm for Finding a Pseudoperipheral Node in a GraphSIAM Journal on Matrix Analysis and Applications, 1990
- Transportation in graphs and the admittance spectrumDiscrete Applied Mathematics, 1987
- Linear Algebra in Geography: Eigenvectors of NetworksMathematics Magazine, 1980
- On the Geographical Interpretation of EigenvaluesTransactions of the Institute of British Geographers, 1967