An efficient method for decomposition of regular structures using graph products

DOI10.1002/NME.1126MaRDI QIDQ5698787zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adjacencybisectiondirect producteigenvaluesgraphsLaplacianpartitioningregular structuresstrong Cartesian product

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical approximation of solutions of dynamical problems in solid mechanics (74H15) Vibrations in dynamical problems in solid mechanics (74H45)

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

Cites work

• scientific article; zbMATH DE number 867649 (Why is no real title available?)
• Optimal structural analysis

Cited in

(24)

• A survey on hypergraph products
• Canonical forms for symmetric and regular structures
• Graph products and its applications in mathematical formulation of structures
• The antistrong property for special digraph families
• Improved group theoretic method using graph products for the analysis of symmetric-regular structures
• New developments in the optimal analysis of regular and near-regular structures: decomposition, graph products, force method
• Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics
• Analysis of space truss towers using combined symmetry groups and product graphs
• Efficient finite element solution of regular and near-regular systems using graph products
• An efficient analysis of repetitive structures generated by graph products
• Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
• Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
• Analysis of structures transformable to circulant form using U-transformation and Kronecker products
• Laplacian matrices of product graphs: applications in structural mechanics
• On the Cartesian skeleton and the factorization of the strong product of digraphs
• Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
• Construction of k-matchings in graph products
• Topology and graph products; eigenproblems in optimal structural analysis
• A local prime factor decomposition algorithm
• Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
• Graph products with specified domains for configuration processing and formation of the adjacency matrices
• Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
• A unified method for eigendecomposition of graph products
• New canonical forms for analytical solution of problems in structural mechanics

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)