An Empirical Comparison of Graph Laplacian Solvers
From MaRDI portal
Publication:5232558
DOI10.1137/1.9781611974317.15zbMath1429.68182OpenAlexW2296073517MaRDI QIDQ5232558
Erik G. Boman, Kevin Deweese, John R. Gilbert
Publication date: 12 September 2019
Published in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974317.15
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (3)
Fast Computation of Spectral Densities for Generalized Eigenvalue Problems ⋮ A combinatorial cut-toggling algorithm for solving Laplacian linear systems ⋮ A queueing network-based distributed Laplacian solver
This page was built for publication: An Empirical Comparison of Graph Laplacian Solvers
