A unified method for eigendecomposition of graph products

Communications in Numerical Methods in Engineering

Volumn 21, Issue 7, 2005, Pages 377-388

  Kaveh, Ali ^a   Rahami, H ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Adjacency; Cartesian product; Direct product; Eigendecomposition; Laplacian; Regular graph; Strong Cartesian product

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; MATRIX ALGEBRA;

COMPUTATIONAL MECHANICS; FINITE ELEMENT MODELS; LAPLACIAN MATRICES;

GRAPH THEORY;

MATHEMATICAL METHOD;

EID: 22244491283     PISSN: 10698299     EISSN: None     Source Type: Journal    
DOI: 10.1002/cnm.753     Document Type: Article

References (23)

1. Kaveh A. Structural Mechanics: Graph and Matrix Methods (3rd edn). Research Studies Press: Somerset, U.K., 2004.
2. Kaveh A. Optimal Structural Analysis (2nd edn). Research Studies Press: Somerset, U.K., 2005.
3. Biggs NL. Algebraic Graph Theory (2nd edn). Cambridge University Press: Cambridge, MA, 1993.
4. Cvetkovié DM, Doob M, Sachs H. Spectra of Graphs, Theory and Applications. Academic Press: New York, 1980.
5. Godsil C, Royle G. Algebraic Graph Theory. Springer: Berlin, New York, 2001.
6. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 1973; 23:298-305.
7. Mohar B. The Laplacian spectrum of graphs. In Graph Theory, Combinatorics and Applications, Alavi Y et al. (eds), vol. 2. Wiley: New York, 1991; 871-898.
8. Pothen A, Simon H, Liou KP. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 1990; 11:430-452.
9. Topping BHV, Sziveri J. Parallel subdomain generation method. Proceedings of Civil-Comp, Edinburgh, U.K., 1995.
10. Kaveh A, Rahami H. A new spectral method for nodal ordering of regular space structures. Finite Elements in Analysis and Design 2004; 40(13/14):1931-1945.
11. Kaveh A, Rahami H. An efficient method for decomposition of regular structures using graph products. International Journal for Numerical Methods in Engineering 2004; 61:1797-1808.
12. Gould P. The geographical interpretation of eigenvalues. Transactions of the Institute of British Geographer 1967; 42:53-58.
13. Grimes RG, Pierce DJ, Simon HD. A new algorithm for finding a pseudo-peripheral node in a graph. SIAM Journal on Analysis and Applications 1990; 11:323-334.
14. Kaveh A. Algebraic and topological graph theory for ordering. Zeitschrift Angewandte Mathematik und Mechanik 1991; 71: T739-T742.
15. Paulino GH, Menezes IFM, Gattass M, Mukherjee S. Node and element resequencing using Laplacian of a finite element graph. Part-I - general concepts and algorithms. International Journal for Numerical Methods in Engineering 1994; 37:1511-1530.
16. Simon HD. Partitioning of unstructured problems for parallel processing. Computing in System Engineering 1991; 2:135-148.
17. Seale C, Topping BHV. Parallel implementation of recursive spectral bisection. Proceedings of Civil Comp 95, Edinburgh, U.K., 1995; 459-473.
18. Kaveh A, Davaran A. Spectral bisection of adaptive finite element meshes for parallel processing. Computers and Structures 1999; 70: 315-327.
19. Kaveh A, Rahimi Bondarabady HA. Spectral trisection of finite element models, computers and structures. International Journal of Numerical Methods for Heat and Fluid Flow 2001; 11:358-370.
20. Kaveh A, Rahimi Bondarabady HA. A multi-level finite element nodal ordering using algebraic graph theory. Finite Elements in Analysis and Design 2002; 38:245-261.
21. Sabidussi G. Graph multiplication. Mathematische Zeitschrift 1960; 72:446-457.
22. Weichsel PM. The Kronecker product of graphs. Proceedings of the American Mathematical Society 1962; 13:47-52.
23. Kaveh A, Rahami H. New canonical forms for analytical solution of problems in structural mechanics, 2005, submitted.