#19822: Fast polynomial evaluation fmpz_poly/ZZX with mpfr/mpfi input
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: algebra | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/19822 | 5562a78b592125e698021743d545f176cc0604bb
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:27 jdemeyer]:
> Benchmarks indicate that the bound degree < 10 makes no sense at all.
The ratio in speed between the old and the new code does not depend on the
degree at all.
>
> Something which is strange: it looks like the precision of the real
number/interval matters: for small precisions, the new code is faster but
for large precisions (> 50000 bits) the old code is faster. This makes no
sense to me! I would guess that both implementations should scale the same
way if the precision is increased. Any clues?
What kind of polynomials did you use? The old code tries to minimize the
number of operation in evaluation. For example `(x+1)^3` is infinitely
smarter than `1 + x(3 + x(3 + x))`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19822#comment:28>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
