#9006: Segfault evaluating large degree polynomials (easy review)
----------------------------+-----------------------------------------------
Reporter: johanbosman | Owner: AlexGhitza
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.4.3
Component: algebra | Keywords:
Author: Johan Bosman | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by johanbosman):
* status: new => needs_review
Old description:
> sage: f = ZZ[[BR]]sage:
> f(1)[[BR]]/home/bosman/sage-4.4.2/local/bin/sage-sage: Zeile 206: 32438
> Segmentation fault sage-ipython "$@" -i
>
> [[BR]]It might be in sage/rings/polynomial/polynomial_compiled.pyx:
> binary_pd has methods that use a recursive implementation, causing a
> stack overflow (but I don't have time now, so I'll try to look at it more
> carefully later).
New description:
sage: f = ZZ[[BR]]sage:
f(1)[[BR]]/home/bosman/sage-4.4.2/local/bin/sage-sage: Zeile 206: 32438
Segmentation fault sage-ipython "$@" -i
It is caused by sage/rings/polynomial/polynomial_compiled.pyx: generic_pd
and derived classes create objects having large chains of dependencies.
They make the recursively implemented methods as well as the garbage
collector run out of stack space. I decided to simply use the 'naive'
method for evaluating large degree polynomials.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9006#comment:1>
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.
