Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
From MaRDI portal
Publication:3590357
DOI10.1002/nme.2245zbMath1195.74073OpenAlexW2152009549MaRDI QIDQ3590357
Publication date: 17 September 2010
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.2245
factorizationLaplacianCartesian productdirect productadjacencyirregular graphsstrong Cartesian productlexi-cographic product
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Eigensolution of augmented graph products using shifted inverse iteration method ⋮ Canonical forms for symmetric and regular structures ⋮ Approximate eigensolution of Laplacian matrices for locally modified graph products ⋮ Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures ⋮ Improved group theoretic method using graph products for the analysis of symmetric-regular structures ⋮ An efficient finite element solution using a large pre-solved regular element ⋮ Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
Cites Work
- Unnamed Item
- Unnamed Item
- Graph multiplication
- Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics
- Spectral trisection of finite element models
- The Kronecker Product of Graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectral bisection of adaptive finite element meshes for parallel processing
- Boolean Operations on Graphs.
- An efficient method for decomposition of regular structures using graph products
This page was built for publication: Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products