#9787: lagrange_polynomial(algorithm='divided_difference') fails over finite
fields
-------------------------------------+-------------------------------------
Reporter: mmezzarobba | Owner: AlexGhitza
Type: defect | Status: needs_review
Priority: minor | Milestone: sage-6.4
Component: algebra | Resolution:
Keywords: | Merged in:
Authors: Peter Bruin | Reviewers: Miguel Marco
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/pbruin/9787-lagrange_polynomial | 57f432cfe194c56c1b258a2d37046d67b15b82ab
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by pbruin):
Replying to [comment:9 mmarco]:
> I would propose something like:
>
> {{{
> seqpoints = Sequence([self.base().an_element()]+list(points))
> points = [seqpoints.universe()(p) for p in points]
> }}}
>
> That way we make sure that all the operations happen in the right parent
(be it the base ring of the parent, or some other parent where both the
input and the parent fit)
Do you mean that `R.lagrange_polynomial()` should potentially return an
element of a different ring than `R`? That would be unnecessarily
confusing in my opinion.
--
Ticket URL: <http://trac.sagemath.org/ticket/9787#comment:10>
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.
