I need to find eigenvalues of a sparse matrix with integer coefficients. I understand in general this is not done by explicitly computing the characteristic polynomial due to numerical instability, but in this case, that shouldn't be a problem? Is there an efficient way to find the polynomial? Is there any befefit from having the coefficients integer at all, or should I just stick to Lanczos algorithm or something similar?
Finding eigenvalues of sparse integer matrix
1
$\begingroup$
matrices
numerical-methods