An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
DOI10.1016/J.CAM.2014.03.018zbMATH Open1291.68437OpenAlexW2023245243MaRDI QIDQ2252255FDOQ2252255
Authors: Jian-Ping Wu, Junqiang Song, Wei-Min Zhang 
Publication date: 16 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.03.018
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)
eigenvalue problemparallel computingpreconditionersparse linear systemFiedler vectorconjugate gradient iteration
Cites Work
- The University of Florida sparse matrix collection
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Preconditioning techniques for large linear systems: A survey
- Parallel iterative methods for sparse linear systems
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Spectral clustering and its use in bioinformatics
- The trace minimization method for the symmetric generalized eigenvalue problem
- Web document clustering using hyperlink structures
- A spectral algorithm for envelope reduction of sparse matrices
- Numerical linear algebra
Cited In (3)
Uses Software
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)
