#14685: error in the computing of the approximate order in LazyPowerSeries
------------------------------------------------------------+---------------
Reporter: MatthieuDien | Owner:
sage-combinat
Type: defect | Status:
new
Priority: major | Milestone:
sage-5.10
Component: combinatorics | Resolution:
Keywords: LazyPowerSeries aorder approximate order | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
------------------------------------------------------------+---------------
Comment (by MatthieuDien):
for chapoton :
I made the patch with a '''diff -Naur ''' but I will fix this.
Thank you for the detailed method.
for nthiery :
I am not sure to understand what you said :
currently the computing of the approximate order cost is amortized on
every request for a serie's term (and it's a little cost). Normally, the
order should be known when the approximate order reaches him.
The patch keeps this behavior.
This was your question ?
Moreover, the current version do not compute the right order too :
{{{
sage: R = LazyPowerSeriesRing(QQ)
sage: B = R([0,0,0,1,0])
sage: B.order
Unknown series order
sage: B.coefficients(10)
[0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
sage: B.aorder
0 #instead of 3
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14685#comment:8>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
