On the approximation of Laplacian eigenvalues in graph disaggregation

DOI10.1080/03081087.2016.1256944zbMath1369.05135arXiv1605.00698OpenAlexW2963178088MaRDI QIDQ5351839

Xiaozhe Hu, John C. Urschel, Ludmil T. Zikatanov

Publication date: 30 August 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00698

zbMATH Keywords

disaggregationpreconditioningspectral approximationspectral graph theorygraph Laplacian

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Preconditioners for iterative methods (65F08)

Related Items (1)

Discrete trace theorems and energy minimizing spring embeddings of planar graphs

This page was built for publication: On the approximation of Laplacian eigenvalues in graph disaggregation