> Thoughts?
> Martin
It's most probably the algorithm used. I have observed that computing
a determinant with multivariate polynomial coefficients is most of the
time faster if you expand minors 2x3 then 3x3 ... up to nxn using
previously computed minors, avoiding divisions. If the coefficients of
the polynomials are rationals with denominators having a not too large
lcm, it is also a good idea to multiply the matrix by the lcm before
computing the det.
If the matrix is not sparse, Fadeev algorithm or other algorithms may
be better.
What is the algorithm used by Singular?
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
