On 11 sep, 17:42, rjf <[EMAIL PROTECTED]> wrote:
> Unless there is something I'm missing here, it seems to me this is a
> classic problem that has been explored in the literature using several
> approaches.
Correct, but we never said it was new :-)
> Depending on the sparsity of the entries, (sparse as polynomials) or
> sparsity of the matrix (as zero entries) and size of coefficients, it
> could be
> possible to expand by minors, use a modular method, use one of several
> versions of Gaussian elimination (eliminating some divisions that
> might seem standard), or some graph-based method.
>
> The answer might be so huge that it won't fit in memory, and that
> certainly bears some analysis before you try to make it "faster".
Is there somewhere a detailled analysis on what algorithm should be
taken? I mean, should the CAS determine what algorithm to use, or
should it be left to the user, or should we launch several algorithms
in parallel and the first one finishing would kill the others or a
combination?
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
