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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1586, Issue , 1999, Pages 978-985

  Holzrichter, Michael ^a   Oliveira, Suely ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

COMBINATORIAL ALGORITHM; DAVIDSON ALGORITHM; GRAPH-BASED METHODS; IRREGULAR PROBLEMS; MEMORY REFERENCES; PARTITIONING METHODS; PRECONDITIONERS; SPECTRAL GRAPH PARTITIONING;

ALGORITHMS;

EID: 84957610758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097982     Document Type: Conference Paper

References (17)

1. I. S. Barnard and H. Simon. A fast multilevel implementation of recursive spectrM bisection for partitioning unstructured problems. In Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, 1993. SIAM, SIAM.
2. L. Borges and S. Oliveira. A parallel Davidson-type algorithm for several eigenvalues. Journal of Computational Physics, (144):763-770, August 1998.
3. T. Chart, 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.
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.
5. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298-305, 1973.
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.
7. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19:701-719, 1998.
8. M. Holzrichter and S. Oliveira. New spectral graph partitioning algorithms, submitted.
9. M. Holzrichter and S. Oliveira. New graph partitioning algorithms. 1998. The University of Iowa TR-120.
10. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular garphs, to appear in the Journal of Parallel and Distributed Computing.
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.
12. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291-307, February 1970.
13. S. McCormick. Multilevel Adaptive Methods for Partial Differential Equations. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1989.
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.
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).
16. H. D. Simon and S. H. Teng. How good is recursive bisection. SIAM Journal on Scientific Computing, 18(5):1436-1445, July 1997.
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.