#9220: Upredictable parent for polynomial evaluation
------------------------+---------------------------------------------------
Reporter: nbruin | Owner: robertwb
Type: defect | Status: new
Priority: major | Milestone: sage-4.4.4
Component: coercion | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
------------------------+---------------------------------------------------
Comment(by nbruin):
Indeed the present code does seem to address real overhead:
{{{
sage: R=QQ['x']
sage: S=QQ['x','y']
sage: h=S.0^2
sage: timeit('h(R.0,0)')
625 loops, best of 3: 269 µs per loop
}}}
but
{{{
sage: R=QQ['x']
sage: S=QQ['u','v']
sage: h=S.0^2
sage: timeit('h(R.0,0)')
625 loops, best of 3: 523 µs per loop
}}}
so option one or two above is probably the proper one.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9220#comment:3>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
