Yes, the sylvester matrix is not the most efficient, but in this small example seemed like the easiest way to convey my point.
So this is really a matter of context and is expected behavior? If so, that means the trac ticket I filed: Ticket #12752 is not actually a defect, but is really an enhancement. On Mar 26, 7:45 pm, Nils Bruin <nbr...@sfu.ca> wrote: > On Mar 25, 6:52 pm, Ben Hutz <bn4...@gmail.com> wrote: > According to the documentation, f.resultant(g) should be computing > f.resultant(g,parent(f)), which is exactly m.determinant(). > If you want to compute the resultant of the two *homogeneous forms*, > you'd need another method, say > form_resultant(f,g) > that throws an error if f,g are not both homogeneous bivariate > polynomials. The implementation would probably dehomogenize and > compute the appropriate polynomial resultant, while compensating for > degree-drop by multiplying by the appropriate powers of leading > coefficients (resultants can be computed much more efficiently than > constructing sylvester matrices). -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
