Hi,
I have coded an algorithm in java that multiplies Sparse Matrix in
Order O(L1 * L2) where L1, L2 is the number of non-zero elements in
the first and second matrix. The space complexity is also Order
O(L1*L2), and I'm willing to port it to python.


This is a good opportunity for me to contribute something small and
useful for sympy, and will be a good way for me to learn how to push
patches to the sympy repository in github

Do tell me if the complexities I have mentioned are okay, and I'll
code it in.

Thanks,
Sherjil

-- 
You received this message because you are subscribed to the Google Groups 
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to 
sympy+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/sympy?hl=en.

Reply via email to