#11380: Computing continued fractions on real quadratic fields
-----------------------------+----------------------------------------------
Reporter: mmasdeu | Owner: was
Type: enhancement | Status: needs_info
Priority: minor | Milestone: sage-4.7.1
Component: number theory | Keywords: norm-euclidean, two-stage
euclidean, continued fraction
Work_issues: | Upstream: N/A
Reviewer: | Author: Xevi Guitart and Marc Masdeu
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by mmasdeu):
Replying to [comment:5 cremona]:
> I don't think I am qualified to review this since I am not familiar with
the algorithm. But I do have one question: Why have you put the new code
into a cython (.pyx) file when it does not seem to contain any cython
code, only python? (I may be wrong, as I did not read it all). If it is
just python, then it can be renamed .py and not included in the
module_list.
I updated the patch with the suggested changes. As for the review, during
this weekend we plan to upload our preprint to the arxiv, and there you
can find the algorithm that we are using explained.
In short, what the only function accessible should do is to return a list
of elements of the ring of integers of the number field, so that they are
a (terminating) continued fraction for the given element.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11380#comment:6>
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.
