I need to find the eigenvalues of a very large sparse matrix (5digit x 5digit dimension). I tried to use 'eig' command but apparently, I don't have enough memory in my RAM ( the return message is always run of out memory). But it is worth to mention that I did this with all the zero entries filled with zeros. This is because when the zero entries are squeezed out (in sparse matrix form), it took forever to run the 'eig' command due to unknown reason so I have to give up. I also tried to do it on GPU, but it was the same situation (run out of memory) when zeros are squeezed out, and GPU can't handle matrix in parse form so the other option is not available. I wonder if it is possible to partition the large matrix into blocks of small segments, do some computation separately first then combine the results from individual parts and somehow obtain the final result from here. Is that a mathematical viable approach? If yes how to do it then? Thanks.