An efficient method for decomposition of regular structures using graph products
DOI10.1002/NME.1126zbMATH Open1075.74539OpenAlexW1971581675MaRDI QIDQ5698787FDOQ5698787
Authors: A. Kaveh, Hossein Rahami 
Publication date: 20 October 2005
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.1126
Recommendations
- Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
- An efficient analysis of repetitive structures generated by graph products
- Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
- Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
- Eigensolution for adjacency and Laplacian matrices of large repetitive structural models
graphseigenvaluesLaplaciandirect productadjacencypartitioningbisectionregular structuresstrong Cartesian product
Applications of graph theory (05C90) Vibrations in dynamical problems in solid mechanics (74H45) Numerical approximation of solutions of dynamical problems in solid mechanics (74H15)
Cites Work
Cited In (24)
- The antistrong property for special digraph families
- A local prime factor decomposition algorithm
- Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
- Laplacian matrices of product graphs: applications in structural mechanics
- Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
- Graph products with specified domains for configuration processing and formation of the adjacency matrices
- Improved group theoretic method using graph products for the analysis of symmetric-regular structures
- Analysis of space truss towers using combined symmetry groups and product graphs
- An efficient analysis of repetitive structures generated by graph products
- Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
- Topology and graph products; eigenproblems in optimal structural analysis
- New canonical forms for analytical solution of problems in structural mechanics
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- New developments in the optimal analysis of regular and near-regular structures: decomposition, graph products, force method
- Analysis of structures transformable to circulant form using U-transformation and Kronecker products
- Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
- Canonical forms for symmetric and regular structures
- Graph products and its applications in mathematical formulation of structures
- A unified method for eigendecomposition of graph products
- Construction of k-matchings in graph products
- Efficient finite element solution of regular and near-regular systems using graph products
- Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
- Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics
- A survey on hypergraph products
This page was built for publication: An efficient method for decomposition of regular structures using graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5698787)
