#2693: Sage should have generic resultant implementation for multivariate
polynomials
--------------------------------------+------------------------
Reporter: cwitty | Owner: was
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.4
Component: algebraic geometry | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------------+------------------------
Changes (by mmarco):
* upstream: => N/A
Comment:
In fact, singular resultants are slow compared to other methods, so it
would really be a good idea to write specific sage code for resultants.
See #16749 and #12174 for ideas about it.
Just something like:
{{{
def resultant(self, other, variable):
m = self.sylvester_matrix(other, variable)
return m.determinant()
}}}
Would be both general for any polynomial ring, and faster than the current
implementation. And of course, there could be a lot of cases where things
can be done much faster, using specific backends where they are better.
--
Ticket URL: <http://trac.sagemath.org/ticket/2693#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
