An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
From MaRDI portal
Publication:2252255
Recommendations
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- scientific article; zbMATH DE number 2087126
- A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
- Bisection for parallel computing using Ritz and Fiedler vectors
- FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B)
Cites work
- A spectral algorithm for envelope reduction of sparse matrices
- Numerical linear algebra
- Parallel iterative methods for sparse linear systems
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Preconditioning techniques for large linear systems: A survey
- Spectral clustering and its use in bioinformatics
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- The University of Florida sparse matrix collection
- The trace minimization method for the symmetric generalized eigenvalue problem
- Web document clustering using hyperlink structures
Cited in
(3)
This page was built for publication: An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252255)