Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Included in the following conference series:

Abstract

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.

This research was supported by NSF grant ASC-9528912, and currently by NSF/DARPA DMS-9874015

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298–305, 1973.

    MATH  MathSciNet  Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  7. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19:701–719, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Holzrichter and S. Oliveira. New spectral graph partitioning algorithms. submitted.

    Google Scholar 

  9. M. Holzrichter and S. Oliveira. New graph partitioning algorithms. 1998. The University of Iowa TR-120.

    Google Scholar 

  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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  12. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291–307, February 1970.

    MATH  Google Scholar 

  13. S. McCormick. Multilevel Adaptive Methods for Partial Differential Equations. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1989.

    MATH  Google Scholar 

  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. 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).

    Article  MATH  MathSciNet  Google Scholar 

  16. H. D. Simon and S. H. Teng. How good is recursive bisection. SIAM Journal on Scientific Computing, 18(5):1436–1445, July 1997.

    Article  MATH  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Texas A&M University, 77843-3112, College Station, TX

    Michael Holzrichter

  2. The University of Iowa, 52242, Iowa City, USA

    Suely Oliveira

Authors
  1. Michael Holzrichter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suely Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Holzrichter, M., Oliveira, S. (1999). A graph based method for generating the fiedler vector of irregular problems. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097982

Download citation

  • DOI: https://doi.org/10.1007/BFb0097982

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation