Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics

International Journal for Numerical Methods in Engineering

Volumn 68, Issue 1, 2006, Pages 33-63

  Kaveh, Ali ^a   Rahami, H ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Adjacency; Block diagonalization matrices; Cartesian; Direct; Eigensolution; Graph products; Laplacian; Lexicographic; Strong Cartesian

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; MATRIX ALGEBRA; OPTIMIZATION;

ADJACENCY MATRIX; BLOCK DIAGONALIZATION MATRICES; CARTESIAN; GRAPH PRODUCTS; LAPLACIAN MATRIX; LEXICOGRAPHIC; STRONG CARTESIAN;

NUMERICAL METHODS;

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION;

EID: 33749377421     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.1696     Document Type: Article

References (21)

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., 2006.
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: 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, entitled Graph Theory. In Combinatorics and Applications, Alavi 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. In Developments in Computational Techniques for Structural Engineering, Civil-Comp Press, Edinburgh, U.K., 1995.
10. Kaveh A, Rahami H. A unified method for eigendecomposition of graph products. Communications in Numerical Methods in Engineering 2005; 21(7):377-388.
11. 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.
12. 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.
13. Gould P. The geographical interpretation of eigenvalues. Transactions of the Institute of British Geographer 1967; 42:53-58.
14. 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.
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. Sabidussi G. Graph multiplication. Mathematische Zeitschrift 1960; 72:446-457.
17. Weichsel PM. The Kronecker product of graphs. Proceedings of the American Mathematical Society 1962; 13:47-52.
18. Harary F, Wilcox GW. Boolean operations on graphs. Mathematica Scandinavica 1967; 20:41-51.
19. Pothen A, Simon HD, Liou KP. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Algebraic Matrix Analysis and Applications 1990; 11:430-452.
20. Kaveh A, Rahimi Bondarabady HA. Spectral trisection of finite element models. International Journal of Numerical Methods for Heat and Fluids 2001; 11(2):358-370.
21. Kaveh A, Rahami H. Unification of three canonical forms with application to stability analysis. Asian Journal of Civil Engineering 2006; 7(2):147-160.