A new spectral method for nodal ordering of regular space structures
Authors:
- A KavehAKA Kaveh
- H RahamiHRH Rahami
- 1 August 2004
- journal article
- Published by Elsevier in Finite Elements in Analysis and Design
- Vol. 40 (13-14) , 1931-1945
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Spectral trisection of finite element modelsInternational Journal of Numerical Methods for Heat & Fluid Flow, 2001
- 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
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973
- On the Geographical Interpretation of EigenvaluesTransactions of the Institute of British Geographers, 1967