Skip to content

fast_callable always segfaults when input is a polynomial of large degree #11766

@williamstein

Description

@williamstein

The fast_callable function is great -- perfect for the application I had in mind, which was running Newton-Raphson on a polynomial of large degree. Unfortunately, it seems fast_callable is implemented recursively, and maybe "blows the stack" as soon as the degree of the input gets large. Here's an example, which fails on both 64-bit Linux and OS X:

sage: R.<x> = CC[];  f = R.random_element(degree=30000)
sage:  time g = fast_callable(f, CC)                   
/home/wstein/sage/sage-4.7.2.alpha2/local/bin/sage-sage: line 301: 15849 Segmentation fault      sage-ipython "$@" -i

CC: @jasongrout

Component: basic arithmetic

Author: Robert Bradshaw

Reviewer: Tom Boothby

Merged: sage-5.0.beta11

Issue created by migration from https://trac.sagemath.org/ticket/11766

Metadata

Metadata

Assignees

Type

No type

Projects

No projects

Milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions