Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Faster minimization of linear wirelength for global placement
Proceedings of the 1997 international symposium on Physical design
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Enhancing Data Locality by Using Terminal Propagation
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
A Subspace Semidefinite Programming for Spectral Graph Partitioning
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Semidefinite programming for graph partitioning with preferences in data distribution
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
| Hi-index | 0.00 |
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph partitioning problem. In this paper, a new subspace algorithm for the solving the extended eigenproblem is presented. The structure of this subspace method allows the incorporation of multigrid preconditioners. We numerically compare our new algorithm with a previous algorithm based on Lanczos iteration and show that our subspace algorithm performs better.