Skip to main content

TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector

  • Conference paper
High Performance Computing for Computational Science – VECPAR 2010 (VECPAR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6449))

Abstract

The eigenvector corresponding to the second smallest eigenvalue of the Laplacian of a graph, known as the Fiedler vector, has a number of applications in areas that include matrix reordering, graph partitioning, protein analysis, data mining, machine learning, and web search. The computation of the Fiedler vector has been regarded as an expensive process as it involves solving a large eigenvalue problem. We present a novel and efficient parallel algorithm for computing the Fiedler vector of large graphs based on the Trace Minimization algorithm. We compare the parallel performance of our method with a multilevel scheme, designed specifically for computing the Fiedler vector, which is implemented in routine MC73_FIEDLER of the Harwell Subroutine Library (HSL).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnard, S.T., Pothen, A., Simon, H.: A spectral algorithm for envelope reduction of sparse matrices. Numerical Linear Algebra with Applications 2(4), 317–334 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Davis, T.A.: University of Florida sparse matrix collection. NA Digest (1997)

    Google Scholar 

  3. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23(2), 298–305 (1973)

    MathSciNet  MATH  Google Scholar 

  4. He, X., Zha, H., Ding, C.H.Q., Simon, H.D.: Web document clustering using hyperlink structures. Computational Statistics & Data Analysis 41(1), 19–45 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Higham, D.J., Kalna, G., Kibble, M.: Spectral clustering and its use in bioinformatics. Journal of Computational and Applied Mathematics, Special issue dedicated to Professor Shinnosuke Oharu on the occasion of his 65th birthday 204(1), 25–37 (2007)

    MathSciNet  MATH  Google Scholar 

  6. HSL. A collection of Fortran codes for large-scale scientific computation (2004), http://www.cse.scitech.ac.uk/nag/hsl/

  7. Hu, Y.F., Scott, J.A.: HSL_MC73: a fast multilevel Fiedler and profile reduction code. Technical Report RAL-TR-2003-036 (2003)

    Google Scholar 

  8. Manguoglu, M.: A parallel hybrid sparse linear system solver. In: Computational Electromagnetics International Workshop, 2009. CEM 2009, pp. 38–43 (July 2009)

    Google Scholar 

  9. Manguoglu, M., Koyutürk, M., Sameh, A.H., Grama, A.: Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers. SIAM Journal on Scientific Computing 32(3), 1201–1216 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Manguoglu, M., Sameh, A.H., Schenk, O.: PSPIKE: A Parallel Hybrid Sparse Linear System Solver. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 797–808. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems 14, pp. 849–856. MIT Press, Cambridge (2001)

    Google Scholar 

  12. Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430–452 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  13. Qiu, H., Hancock, E.R.: Graph matching and clustering using spectral partitions. Pattern Recognition 39(1), 22–34 (2006)

    Article  Google Scholar 

  14. Sameh, A., Tong, Z.: The trace minimization method for the symmetric generalized eigenvalue problem. J. Comput. Appl. Math. 123(1-2), 155–175 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sameh, A.H., Wisniewski, J.A.: A trace minimization algorithm for the generalized eigenvalue problem. SIAM Journal on Numerical Analysis 19(6), 1243–1259 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shepherd, S.J., Beggs, C.B., Jones, S.: Amino acid partitioning using a fiedler vector model. Journal European Biophysics Journal 37(1), 105–109 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manguoglu, M., Cox, E., Saied, F., Sameh, A. (2011). TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector. In: Palma, J.M.L.M., Daydé, M., Marques, O., Lopes, J.C. (eds) High Performance Computing for Computational Science – VECPAR 2010. VECPAR 2010. Lecture Notes in Computer Science, vol 6449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19328-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19328-6_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19327-9

  • Online ISBN: 978-3-642-19328-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics