I am working with very large graphs and their corresponding weighted adjacency matrices, and I need to take these large matrices to similarly large powers (i.e. raising matrices to the power of tens of thousands).
The issue I have run into is that elements of the matrix quickly become too large for the computer to handle, and I am wondering how to get around this problem.
Has anyone worked with such problems before(raising matrices to large powers), and how did you resolve them?
I know Python's numpy can handle these computations. Is there an analogous library in Julia that can do this as well?
A = U'DUyou can just take the desired power ofD, that is the eigenvalues on the diagonal. - carstenbauerU. But this is pretty much unavoidable. - carstenbauer