A graph based method for generating the fiedler vector of irregular problems

  • Michael Holzrichter
  • Suely Oliveira
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)


In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and application of the Lanczos method when the graph allows this method to be cheap enough. Our new algorithms are purely spectral. They calculate the Fiedler vector of the original graph and use the information about the problem in the form of a preconditioner for the graph Laplacian. In addition, we use a favorable subspace for starting the Davidson algorithm and reordering of variables for locality of memory references.


Beach Lval 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Barnard and H. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, 1993. SIAM, SIAM.Google Scholar
  2. 2.
    L. Borges and S. Oliveira. A parallel Davidson-type algorithm for several eigenvalues. Journal of Computational Physics, (144):763–770, August 1998.Google Scholar
  3. 3.
    T. Chan, P. Ciarlet Jr., and W. K. Szeto. On the optimality of the median cut spectral bisection graph partitioning method. SIAM Journal on Computing, 18(3):943–948, 1997.MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    E. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Journal of Computational Physics, 17:87–94, 1975.MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298–305, 1973.MATHMathSciNetGoogle Scholar
  6. 6.
    M. Fiedler. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25:619–632, 1975.MATHMathSciNetGoogle Scholar
  7. 7.
    S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19:701–719, 1998.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    M. Holzrichter and S. Oliveira. New spectral graph partitioning algorithms. submitted.Google Scholar
  9. 9.
    M. Holzrichter and S. Oliveira. New graph partitioning algorithms. 1998. The University of Iowa TR-120.Google Scholar
  10. 10.
    G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular garphs. to appear in the Journal of Parallel and Distributed Computing.Google Scholar
  11. 11.
    G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359–392, 1999.MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291–307, February 1970.MATHGoogle Scholar
  13. 13.
    S. McCormick. Multilevel Adaptive Methods for Partial Differential Equations. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1989.MATHGoogle Scholar
  14. 14.
    S. Oliveira. A convergence proof of an iterative subspace method for eigenvalues problem. In F. Cucker and M. Shub, editors, Foundations of Computational Mathematics Selected Papers, pages 316–325. Springer, January 1997.Google Scholar
  15. 15.
    Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430–452, 1990. Sparse matrices (Gleneden Beach, OR, 1989).MATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    H. D. Simon and S. H. Teng. How good is recursive bisection. SIAM Journal on Scientific Computing, 18(5):1436–1445, July 1997.MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    D. Spielman and S. H. Teng. Spectral partitioning works: planar graphs and finite element meshes. In 37th Annual Symposium Foundations of Computer Science, Burlington, Vermont, October 1996. IEEE, IEEE Press.Google Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Michael Holzrichter
    • 1
  • Suely Oliveira
    • 2
  1. 1.Texas A&M UniversityCollege Station
  2. 2.The University of IowaIowa CityUSA

Personalised recommendations