Hi all, thank you for your answers so far.
Mateusz Paprocki wrote: >> I wonder why there are fractions in the result (all the more as in the >> docstring of det_bareis one reads, that the algorihtm "will result in a >> determinant with minimal number of fractions".). >> > > Minimal does not mean none, although there should be written 'minimal > number of levels of nested fractions'. In my understanding 'minimal' means: impossible to have less. So I was a bit confused because obviously there is the possibility to have less fractions (i.e. 0). > copyrights has been helping to test the 1766 branch at github/smichr. > In that branch I get: > >>>> from sympy.abc import a,b,c,d, C >>>> M = Matrix([[a+b, 0, cos(c)], [0, d, 0], [cos(c), 0, 1]]) >>>> M.det() > a*d + b*d - d*cos(c)**2 I do not understand what the copyright remark means, but indeed it works. I must admit that it took me a while to find the repo and to switch the branch. I never used git before, just hg and that always with just one branch. Maybe it should be mentioned in the github wiki how one can switch to the 1766 branch (which is mentioned in many mailinglist threads and seems to include some very good imporvements). Thanks. Bastian. -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
