<F3.566e+05> B. N.<F3.809e+05> Parlett,<F3.37e+05> The Symmetric Eigenvalue<F3.809e+05> Problem, Prentice-Hall, Englewood Cli#s, NJ, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fast And High Quality Multilevel Scheme For Partitioning.. - Karypis, Kumar (1998) (275 citations) (Correct)
....of the y vector. Let P [j] 1 for all vertices such that y j # r, and let P [j] 2 for all the other vertices. Since we are interested in bisections of equal size, the value of r is chosen as the weighted median of the values of y i . The eigenvector y is computed using the Lanczos algorithm [42]. This algorithm is iterative and the number of iterations required depends on the desired accuracy. In our experiments, we set the accuracy to 10 2 and the maximum number of iterations to 100. 4.2. KL algorithm. The KL algorithm [31] is iterative in nature. It starts with an initial bipartition ....
<F3.746e+05> B. N.<F3.819e+05> Parlett,<F3.543e+05> The Symmetric Eigenvalue<F3.819e+05> Problem, Prentice--Hall, Englewood Cli#s, NJ, 1980.
Computing Matrix Eigenvalues And Polynomial Zeros Where The.. - Bini, Pan (1998) (Correct)
No context found.
<F3.566e+05> B. N.<F3.809e+05> Parlett,<F3.37e+05> The Symmetric Eigenvalue<F3.809e+05> Problem, Prentice-Hall, Englewood Cli#s, NJ, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC