Used in symmetricEigs() to distinguish which k eigenvalues should be calculated first.
Compute the leading k eigenvalues and eigenvectors on a symmetric square matrix using ARPACK.
Compute the leading k eigenvalues and eigenvectors on a symmetric square matrix using ARPACK.
The caller needs to ensure that the input matrix is real symmetric. This function requires
memory for n*(4*k+4)
doubles.
a function that multiplies the symmetric matrix with a DenseVector.
dimension of the square matrix (maximum Int.MaxValue).
number of leading eigenvalues required, 0 < k < n.
which k eigenvalues should be calculated first.
tolerance of the eigs computation.
the maximum number of Arnoldi update iterations.
a dense vector of eigenvalues in descending order and a dense matrix of eigenvectors (columns of the matrix).
The number of computed eigenvalues might be smaller than k when some Ritz values do not satisfy the convergence criterion specified by tol (see ARPACK Users Guide, Chapter 4.6 for more details). The maximum number of Arnoldi update iterations is set to 300 in this function.
(Since version ) see corresponding Javadoc for more information.