I have a huge sparse matrix and I want to have the smallest eigenvalue and its corresponding eingenvector. I use this code (a used a smaller matrix for the example):
A = {{1,0,0},{0,-2,0},{0,0,5}};
{val,vec} = Eigensystem[A,-1];
Print[val];
Print[vec];
I want to have -2 and {0,1,0} as output, but instead I get the eigenvalue with the lowest magnitude, here 1 and {1,0,0}. Is there a way to get the eigenvalue with the lowest value?
"Criteria"
suboption seems to be completely ignored in the exact case... $\endgroup$ – J. M.'s ennui♦ Mar 18 '16 at 12:29In[1705]:= A = {{1, 0, 0}, {0, -2, 0}, {0, 0, 5}}; {val, vec} = Eigensystem[A + 10*IdentityMatrix[3], -1] + {-10, 0} Out[1706]= {{-2}, {{0, 1, 0}}}
$\endgroup$ – Daniel Lichtblau Mar 18 '16 at 15:47In[1709]:= A = {{1, 0, 0}, {0, -2, 0}, {0, 0, 5}}; {val, vec} = Eigensystem[A - 10*IdentityMatrix[3], 1] + {10, 0} Out[1710]= {{-2}, {{0, 1, 0}}}
(I'd figure out which is the better way to go about this, but I need more coffee...) $\endgroup$ – Daniel Lichtblau Mar 18 '16 at 15:50