A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models

  • Suely Oliveira
  • Takako Soma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)


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.


Subspace Method Graph Partitioning Lanczos Algorithm Spectral Algorithm Multilevel Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    R. P. Brent. Algorithms for Minimization without Derivatives. Automatic Computation. Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar
  3. 3.
    G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, Maryland, 3rd edition, 1996.zbMATHGoogle Scholar
  4. 4.
    B. Hendrickson and R. Leland. The Chaco user’s guide, version 2.0. Technical Report SAND-95-2344, Sandia National Laboratories, 1995.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.MathSciNetCrossRefGoogle Scholar
  7. 7.
    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.CrossRefGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.MathSciNetCrossRefGoogle Scholar
  10. 10.
    B. Kerninghan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291–307, 1970.CrossRefGoogle Scholar
  11. 11.
    J. Nocedal and S. J. Wright. Numerical Optimization. Springer, Berlin, Heidelberg, New York, 1999.CrossRefGoogle Scholar
  12. 12.
    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.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Suely Oliveira
    • 1
  • Takako Soma
  1. 1.The Department of Computer ScienceThe University of IowaIowa CityUSA

Personalised recommendations