Book chapter
A graph based method for generating the fiedler vector of irregular problems
Parallel and Distributed Processing, pp.978-985
Lecture Notes in Computer Science, Springer Berlin Heidelberg
10/28/2006
DOI: 10.1007/BFb0097982
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.
Details
- Title: Subtitle
- A graph based method for generating the fiedler vector of irregular problems
- Creators
- Michael Holzrichter - Texas A&M UniversitySuely Oliveira - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Parallel and Distributed Processing, pp.978-985
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/BFb0097982
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 10/28/2006
- Academic Unit
- Mathematics; Computer Science
- Record Identifier
- 9984259485102771
Metrics
9 Record Views