TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
From MaRDI portal
Recommendations
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
- scientific article; zbMATH DE number 2087126
- A graph based Davidson algorithm for the graph partitioning problem
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
Cites work
- A spectral algorithm for envelope reduction of sparse matrices
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectral clustering and its use in bioinformatics
- The trace minimization method for the symmetric generalized eigenvalue problem
- The University of Florida sparse matrix collection
- Web document clustering using hyperlink structures
- Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers
Cited in
(7)- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- MC73
- A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
- Parallel hybrid sparse linear system solvers
- scientific article; zbMATH DE number 2087126 (Why is no real title available?)
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- Efficient training of deep networks using guided spectral data selection: a step toward learning what you need
This page was built for publication: TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081383)