Eigensolution of Laplacian matrices for graph partitioning and domain decomposition

DOI10.1108/02644400910985198zbMath1257.65020OpenAlexW1521300797MaRDI QIDQ4908062

Babak Alinejad, Ali Kaveh

Publication date: 27 February 2013

Published in: Engineering Computations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/02644400910985198

zbMATH Keywords

graph theoryeigenvalues and eigenfunctionsLaplace series

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

On the Kronecker products and their applications ⋮ Laplacian matrices of product graphs: applications in structural mechanics

Cites Work

• Graph multiplication
• Spectral trisection of finite element models
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
• Spectral bisection of adaptive finite element meshes for parallel processing
• An efficient method for decomposition of regular structures using graph products
• A multi-level finite element nodal ordering using algebraic graph theory
• Unnamed Item

This page was built for publication: Eigensolution of Laplacian matrices for graph partitioning and domain decomposition