Analysis of team ranking

[Ether]

Originally Posted by dakaufma

It finished in 68 seconds.

Try this instead:

1) compute N = A^T∙A

2) compute d = A^T∙b

3) compute teamscores = scipy.linalg.cho_solve(scipy.linalg.cho_factor(N), d)

... where A is np.array(matchdata) and b is np.array(matchscores)

The computation time should be reduced from 68 seconds to about 2 seconds or less.

[Ether]

Originally Posted by Ether

1) compute N = A^T∙A

2) compute d = A^T∙b

3) compute teamscores = scipy.linalg.cho_solve(scipy.linalg.cho_factor(N), d)

... where A is np.array(matchdata) and b is np.array(matchscores)

The computation time should be reduced from 68 seconds to about 2 seconds or less.

I'd run this test myself but I have Python2.7.5 installed and your Python3 code crashes when I try to run it. Not being very fluent in Python, I'm not in a good position to try to port it.

Based on some testing I did here, I'm fairly confident that your computation time can be dramatically reduced by making the small changes shown above.