Bisymmetric, Persymmetric Matrices and Its Applications in Eigen-decomposition of Adjacency and Laplacian Matrices
In this paper we introduce an efficient solution
method for the Eigen-decomposition of bisymmetric and per
symmetric matrices of symmetric structures. Here we decompose
adjacency and Laplacian matrices of symmetric structures to submatrices
with low dimension for fast and easy calculation of
eigenvalues and eigenvectors. Examples are included to show the
efficiency of the method.
[1] Bathe KJ, Wilson EL. Numerical Methods for Finite Element Analysis.
Prentice Hall: Englewood Clffis,NJ, 1976.
[2] Livesley RK. Mathematical Methods for Engineers. Ellis Horwood:
Chichester, U.K., 1989.
[3] George J. Simitses, Dewey H. Hodges. Fundamentals of Structural
Stability. Elsevier Inc. 2006.
[4] Jennings A, McKeown JJ. Matrix Computation. Wiley: New York, 1992.
[5] A. Kaveh and H. Rahami, New canonical forms for analytical solution of
problems in structural mechanics, Communications in Numerical
Methods in Engineering, No. 9, 21(2005) 499-513.
[6] Kaveh A., Nouri M. and Taghizadieh N.: Eigensolution for adjacency
and Laplacian matrices of large repetitive structural models. Scientia
Iranica, 16(2009)481-489.
[7] Nouri M.: Free vibration of large regular repetitive structural structures,
International Journal of Science and Engineering Investigations,
Volume 1, Issue 1, 2012, Pages 92-96.
[8] Cuppen, J.J.M. "A divide and conquer method for the symmetric
tridiagonal eigenproblem", Numerische Mathematik, 36, pp. 177-195
(1981).
[9] Kaveh A., Nouri M. and Taghizadieh N.: An efficient solution method
for the free vibration of large repetitive space structures. Advances in
Structural Engineering, 14(2011)151-161.
[10] Kaveh, A. Structural Mechanics: Graph and Matrix Methods, 3rd ed.
Somerset: Research Studies Press, 2004.
[11] A. Kaveh and K. Koohestani, Combinatorial optimization of special
graphs for nodal ordering and graph partitioning, Acta Mechanica, Nos.
(1-2), 207(2009)95-108.
[1] Bathe KJ, Wilson EL. Numerical Methods for Finite Element Analysis.
Prentice Hall: Englewood Clffis,NJ, 1976.
[2] Livesley RK. Mathematical Methods for Engineers. Ellis Horwood:
Chichester, U.K., 1989.
[3] George J. Simitses, Dewey H. Hodges. Fundamentals of Structural
Stability. Elsevier Inc. 2006.
[4] Jennings A, McKeown JJ. Matrix Computation. Wiley: New York, 1992.
[5] A. Kaveh and H. Rahami, New canonical forms for analytical solution of
problems in structural mechanics, Communications in Numerical
Methods in Engineering, No. 9, 21(2005) 499-513.
[6] Kaveh A., Nouri M. and Taghizadieh N.: Eigensolution for adjacency
and Laplacian matrices of large repetitive structural models. Scientia
Iranica, 16(2009)481-489.
[7] Nouri M.: Free vibration of large regular repetitive structural structures,
International Journal of Science and Engineering Investigations,
Volume 1, Issue 1, 2012, Pages 92-96.
[8] Cuppen, J.J.M. "A divide and conquer method for the symmetric
tridiagonal eigenproblem", Numerische Mathematik, 36, pp. 177-195
(1981).
[9] Kaveh A., Nouri M. and Taghizadieh N.: An efficient solution method
for the free vibration of large repetitive space structures. Advances in
Structural Engineering, 14(2011)151-161.
[10] Kaveh, A. Structural Mechanics: Graph and Matrix Methods, 3rd ed.
Somerset: Research Studies Press, 2004.
[11] A. Kaveh and K. Koohestani, Combinatorial optimization of special
graphs for nodal ordering and graph partitioning, Acta Mechanica, Nos.
(1-2), 207(2009)95-108.
@article{"International Journal of Engineering, Mathematical and Physical Sciences:54605", author = "Mahdi Nouri", title = "Bisymmetric, Persymmetric Matrices and Its Applications in Eigen-decomposition of Adjacency and Laplacian Matrices", abstract = "In this paper we introduce an efficient solution
method for the Eigen-decomposition of bisymmetric and per
symmetric matrices of symmetric structures. Here we decompose
adjacency and Laplacian matrices of symmetric structures to submatrices
with low dimension for fast and easy calculation of
eigenvalues and eigenvectors. Examples are included to show the
efficiency of the method.", keywords = "Graphs theory, Eigensolution, adjacency and
Laplacian matrix, Canonical forms, bisymmetric, per symmetric.", volume = "6", number = "7", pages = "733-4", }