On Sep 10, 11:16 am, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
> Hi parisse,
>
> I agree that this is a question of which algorithm is used.
>
> Singular uses two algorithms:
>
> poly smCallDet(ideal I)
>
> which uses Bareiss
>
> and
>
> poly singclap_det(matrix m)
>
> which seems to be a multi-modular approach. The heuristic to choose between
> the two is implemented in smCheckDet.
>
> How fast ist Giac for this particular computation?
>
I did not really test, since I don't know how to print sage matrices
using compatible (e.g. maple) syntax. I made just the test with a 8x8
matrix, where Bareiss and minor expansion are comparable (around 0.25s
on sage which means slower than singular). I guess, multi-modular
approach is the best for dense matrices.
Did you check how fast singular is for the Lewis-Wester determinants?
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
