An efficient method for decomposition of regular structures using graph products
From MaRDI portal
Publication:5698787
DOI10.1002/nme.1126zbMath1075.74539OpenAlexW1971581675MaRDI QIDQ5698787
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
partitioningeigenvaluesgraphsLaplaciandirect productadjacencybisectionregular 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)
Related Items (21)
Construction of k-matchings in graph products ⋮ Topology and graph products; eigenproblems in optimal structural analysis ⋮ Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics ⋮ Analysis of structures transformable to circulant form using U-transformation and Kronecker products ⋮ Laplacian matrices of product graphs: applications in structural mechanics ⋮ Analysis of space truss towers using combined symmetry groups and product graphs ⋮ A survey on hypergraph products ⋮ Canonical forms for symmetric and regular structures ⋮ Graph products and its applications in mathematical formulation of structures ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ New canonical forms for analytical solution of problems in structural mechanics ⋮ Graph products with specified domains for configuration processing and formation of the adjacency matrices ⋮ Eigensolution of Laplacian matrices for graph partitioning and domain decomposition ⋮ A local prime factor decomposition algorithm ⋮ Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures ⋮ Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products ⋮ Improved group theoretic method using graph products for the analysis of symmetric-regular structures ⋮ Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models ⋮ A unified method for eigendecomposition of graph products ⋮ The antistrong property for special digraph families ⋮ New developments in the optimal analysis of regular and near-regular structures: decomposition, graph products, force method
Cites Work
This page was built for publication: An efficient method for decomposition of regular structures using graph products