[sympy] gcd

2013-07-11 Thread Stephen Loo
Hi all, I found that there are many different kind of gcd in sympy different module, such as sympy.core.numbers.igcd sympy.polys.polytools.gcd sympy.polys.polytools.gcdex sympy.polys.polytools.gcd_list sympy.polys.polytools.half_gcdex And the new one sympy.solvers.diophantine.extended_euclid T

Re: [sympy] gcd

2013-07-11 Thread Mateusz Paprocki
Hi, On 11 July 2013 10:17, Stephen Loo wrote: > Hi all, > > I found that there are many different kind of gcd in sympy different > module, such as > > sympy.core.numbers.igcd > sympy.polys.polytools.gcd > sympy.polys.polytools.gcdex > sympy.polys.polytools.gcd_list > sympy.polys.polytools.half_g

[sympy] ImmutableMatrix bugs

2013-07-11 Thread F. B.
I noticed some methods of BasicMatrix use a trick to create a zero matrix, then compiling its values and returning it, e.g. newmat = self.zeros(self.rows, self.cols + rhs.cols) newmat[:, :self.cols] = self newmat[:, self.cols:] = rhs return newmat This works we

Re: [sympy] gcd

2013-07-11 Thread Thilina Rathnayake
Hi, I implemented the extended_euclid() in Diophantine module without knowing that gcdex() existed. However, Chris pointed out that extended_euclid() is much faster. Take a look at here. He suggested to rename extended_euclid() to

[sympy] Re: gcd

2013-07-11 Thread Stephen Loo
gcdex() handle expression only, no redundant. Stephen Loo於 2013年7月11日星期四UTC+8下午4時17分45秒寫道: > > Hi all, > > I found that there are many different kind of gcd in sympy different > module, such as > > sympy.core.numbers.igcd > sympy.polys.polytools.gcd > sympy.polys.polytools.gcdex > sympy.polys.po

Re: [sympy] gcd

2013-07-11 Thread Mateusz Paprocki
Hi, On 11 July 2013 11:14, Thilina Rathnayake wrote: > Hi, > > I implemented the extended_euclid() in Diophantine module without knowing > that > gcdex() existed. However, Chris pointed out that extended_euclid() is > much faster. > Take a look at > here

Re: [sympy] gcd

2013-07-11 Thread Mateusz Paprocki
Hi, On 11 July 2013 11:14, Thilina Rathnayake wrote: > Hi, > > I implemented the extended_euclid() in Diophantine module without knowing > that > gcdex() existed. However, Chris pointed out that extended_euclid() is > much faster. > Take a look at > here

Re: [sympy] gcd

2013-07-11 Thread Christophe Bal
Hello, gcd(a ; b ; c) = gcd(a ; gcd(b ; c)) = gcd(gcd(a ; b) ; c)). The best ways to compute gcd(a ; b ; c ; d ; e ; ...) should be to first sort the arguments. If we suppose that a <= b <= c <= d <= e <= ... . Let L be this list of integers. Then you can apply the following steps. 1) Comp

[sympy] Re: gcd

2013-07-11 Thread Stephen Loo
Thanks, gcd is more complicated than what I think. Stephen Loo於 2013年7月11日星期四UTC+8下午4時17分45秒寫道: > > Hi all, > > I found that there are many different kind of gcd in sympy different > module, such as > > sympy.core.numbers.igcd > sympy.polys.polytools.gcd > sympy.polys.polytools.gcdex > sympy.poly

Re: [sympy] gcd

2013-07-11 Thread Mateusz Paprocki
Hi, On 11 July 2013 12:04, Christophe Bal wrote: > Hello, > gcd(a ; b ; c) = gcd(a ; gcd(b ; c)) = gcd(gcd(a ; b) ; c)). > > The best ways to compute gcd(a ; b ; c ; d ; e ; ...) should be to first > sort the arguments. If we suppose that a <= b <= c <= d <= e <= ... . Let > L be this list of i

Re: [sympy] gcd

2013-07-11 Thread Stephen Loo
2) If L is empty, g is the gcd, else L.pop(0), L[0] = g and goto 1). Christophe Bal於 2013年7月11日星期四UTC+8下午6時04分19秒寫道: > > Hello, > gcd(a ; b ; c) = gcd(a ; gcd(b ; c)) = gcd(gcd(a ; b) ; c)). > > The best ways to compute gcd(a ; b ; c ; d ; e ; ...) should be to first > sort the arguments. If we s

[sympy] Re: The Vectors and Electromagnetism GSoC projects

2013-07-11 Thread Prasoon Shukla
Hmm. I tried that going from frame[99] ->frame[0] ->frame[98]. Just finding out frame[99] -> frame[0] was taking forever so I stopped the process. Nevertheless, I tried a few test and I think that going through global might take longer after all - not for all the situations, but for most. Sach

[sympy] Re: Basic doubt regarding installation of gmpy

2013-07-11 Thread Saurabh Jha
Thank you, it's installed now. :) -Saurabh -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sym

[sympy] Hacked Twitter account

2013-07-11 Thread Aaron Meurer
Hi. Some of you may have received a spam message from the Twitter account @SymbolicPython. Just to be clear, we do not own that account. If anyone on this list knows who does own that account (or used to own it at least, before it was hacked), please let me know. I have contacted Twitter, but in

Re: [sympy] New Data structure for Dense Matrix

2013-07-11 Thread Saurabh Jha
I have just rewritten and add a few functions for row operations in my current PR. The diff looks quite messy just have a look at [1]. This is rewritten although it is largely the same. Here is the summary of profile results. I am now using gmpy ground types. >>> for i in range(1000, 3000):

[sympy] Re: New Data structure for Dense Matrix

2013-07-11 Thread mario
At 0-th level the elements of the matrix should be in a ring, e.g. ``ZZ``, so it should not be necessary to cast them; for instance in ``mulrowcol`` ``result += K(row[i])*K(col[i])`` is much slower than ``result += row[i]*col[i]`` -- You received this message because you are subscribed to the Go

Re: [sympy] Re: Release Notes Request

2013-07-11 Thread Matthew Rocklin
I just read Aaron's blogpost about the release http://asmeurersympy.wordpress.com/2013/07/07/automating-the-sympy-release-process/ He mentions that everything is done except for the release notes. I went to go check the notes out and I'm happy I did. There were a lot of things that have been don

Re: [sympy] Re: Release Notes Request

2013-07-11 Thread Aaron Meurer
Yes, please do help out with this. Thanks you Matthew for doing this. I would feel much better if someone could do a glance through on all the pull requests and make sure that nothing is missing. You don't have to write the notes for the things you find missing if you don't want. Just make a note

Re: [sympy] Re: Release Notes Request

2013-07-11 Thread Saurabh Jha
Should I add the backend stuff (CSR, DOK representation) in docs[1]. The thing is they are not used right now in main sparse module, so I am not sure about this. I am going to add other things though [2] -Saurabh [1] https://github.com/sympy/sympy/pull/2169 [2] https://github.com/sympy/sympy/pu

Re: [sympy] Re: Release Notes Request

2013-07-11 Thread Aaron Meurer
I wouldn't worry about stuff that isn't public facing. For minor changes, people can look at the commit history. Aaron Meurer On Thu, Jul 11, 2013 at 10:30 PM, Saurabh Jha wrote: > Should I add the backend stuff (CSR, DOK representation) in docs[1]. The > thing is they are not used right now in