Can I find nonnegative eigenvalues using eigs

In a very large sparse matrix I want to use eigs function to find all non-negative eigenvalues and corresponding eigenvectors, is it possible?

Answer 1

[Paul]

Yes it is. At least if its a symmetric matrix. Else you can only get n-2 eigenvalues, where (n,n) is the size of the matrix. Just output all the eigenvalues and then get the non-negative ones.

[mim]

Thanks for your answer, but it is obvious that I can obtain all then choose non negative, but I want to do it in only one step. The matrix is real symmetric

[Paul]

So I guess you're asking if there is an option to set to get only non-negative eigenvalues, which there isn't. Why isn't doing it in more steps not good enough if I may ask?

[mim]

just because I want to do it faster