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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. J. Alpert, T. F. Chan, D. J.-H. Huang, A. B. Kahng, I. L. Markov, P. Mulet, and K. Yan. Faster Minimization of Linear Wirelength for Global Placement. In Proc. Intl. Symposium on Physical Design, 1997.
R. P. Brent. Algorithms for Minimization without Derivatives. Automatic Computation. Prentice-Hall, Englewood Cliffs, NJ, 1973.
G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, Maryland, 3rd edition, 1996.
B. Hendrickson and R. Leland. The Chaco user’s guide, version 2.0. Technical Report SAND-95-2344, Sandia National Laboratories, 1995.
B. Hendrickson, R. Leland, and R. V. Driessche. Enhancing data locality by using terminal propagation. In Proc. 29th Hawaii Intl. Conf. System Science, volume 16, 1996.
M. Holzrichter and S. Oliveira. A graph based Davidson algorithm for the graph partitioning problem. International Journal of Foundations of Computer Science, 10:225–246, 1999.
M. Holzrichter and S. Oliveira. A graph based method for generating the Fiedler vector of irregular problems. In Lecture Notes in Computer Science 1586, Parallel and Distributed Processing, 11 IPPS/SPDP’99, pages 978–985, 1999.
G. Karypis and V. Kumar. METIS: Unstructured graph partitioning and sparse matrix ordering system Version 2.0. Technical report, Department of Computer Science, University of Minnesota, 1995.
George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359–392 (electronic), 1999.
B. Kerninghan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291–307, 1970.
J. Nocedal and S. J. Wright. Numerical Optimization. Springer, Berlin, Heidelberg, New York, 1999.
A. Pothen, H. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvector of graphs. SIAM J. Matrix. Anal. Appl., 11(3):430–452, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, S., Soma, T. (2000). A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_64
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive