Inefficiency with matrix multiplication

[damianjilk2]

Solution is as follows: matrix_iteration = np.zeros(N,N) tmp_matrix = np.identity(N) for i in range(iterations): matrix_iteration += tmp_matrix tmp_matrix = tmp_matrix * probability_matrix This problem exists where the probability matrix is multiplied by the source distribution of incrementing powers until convergence. Note: not fixed yet in case it is proved irrelevant with new equations.

[damianjilk2]

Solution code by Paul found in commit number 0bce300