#15625: Refactor Lucas sequence code
--------------------------------+----------------------------------
Reporter: jpflori | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.1
Component: basic arithmetic | Keywords: lucas sequence
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
--------------------------------+----------------------------------
As pointed by Paul Zimmerman in ticket:11802#comment:16, the Lucas
sequence which has been finally sped up and generalized in #11802, needs
serious refactoring:
1) it makes no sense to have a {{{slow_lucas}}} and a {{{fast_lucas}}}
function. The philosophy in Sage is to use {{{algorithm='recurrence'}}} or
{{{algorithm='matrix_exponentiation'}}} instead (for example).
2) I don't see why the case Q<>1 could not be implemented either by the
recurrence or the matrix
exponentiation.
3) instead of separate functions for ZZ and IntegerModRing(n), it would be
nicer to have a single function with an option {{{ring=ZZ}}} (default) and
{{{ring=IntegerModRing(15)}}}.
--
Ticket URL: <http://trac.sagemath.org/ticket/15625>
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.
For more options, visit https://groups.google.com/groups/opt_out.
