KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
This is a follow up to How to set up and solve simultaneous equations in python but I feel deserves its own reputation points for any answer. For a fixed integer n , I have a set of 2(n-1) simultaneous equations as follows. M(p) = 1+((n-p-1)/n)*M(n-1) + (2/n)*N(p-1) + ((p-1)/n)*M(p-1) N(p) = 1+((n-p-1)/n)*M(n-1) + (p/n)*N(p-1) M(1) = 1+((n-2)/n)*M(n-1) + (2/n)*N(0) N(0) = 1+((n-1)/n)*M(n-1) M(p) is defined for 1 <= p <= n-1 . N(p) is defined for 0 <= p <= n-2 . Notice also that p is just a constant integer in every equation so the whole system is linear. Some very nice answers were given for how to set up a system of equations in python. However, the system is sparse and I would like to solve it for large n. How can I use scipy's sparse matrix representation and http://docs.scipy.org/doc/scipy/reference/sparse.linalg.html for example instead?
Tags (comma-separated)
Save Edits
Cancel