Abstract
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. © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Oliveira, S., & Soma, T. (2000). A multilevel algorithm for spectral partitioning with extended eigen-models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 477–484). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
