|
Size: 1734
Comment:
|
← Revision 50 as of 2022-04-05 01:04:50 ⇥
Size: 0
Comment: outdated
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| A page to summarise and coordinate SAGE development activity. == Core arithmetic team == David Harvey, Martin Albrecht, Joel Mohler, Robert Bradshaw, William Stein * Develop new {{{__mul__}}} semantics for rings/algebras using something like {{{ToyQuarternionAlgebraElement}}} as a test case. * Migrate {{{_add_}}}, {{{_mul_}}} etc to new {{{_add_sibling}}}, {{{_add_sibling_cdef}}}, framework etc. Intention is to eventually remove {{{_add_}}} everywhere. * Change all {{{__add__}}} methods (etc) to use new fast code pathways, pyrex tricks, as studied at SAGE Days 2. * Try changing {{{a.parent() == b.parent()}}} conditions to {{{a._parent is b._parent}}} in various places and see what breaks. * Write up more entries in WritingFastPyrexCode. (''everyone'') * Write a benchmarking module. * Optimise pyrex in coercion module. * Make Algebra {{{_base_ring}}} into a cdef attribute. * Move univariate Polynomial class down to Pyrex, and make it inherit from {{{CommutativeAlgebra}}} instead of {{{CommutativeRing}}}. (''David'') * Rewrite polynomials over Z and Z/nZ using direct NTL calls. (''David'') * Optimise new integers mod n code using fast pyrex tricks. * Wrap NTL finite fields and polynomials over finite fields. * Benchmark omalloc. (''Martin'') * Linear algebra (perhaps William or Robert want to say something here?) == Packaging and Integration == William Stein * Getting sage-1.4.1 ready: * New maxima, pari, clisp. * Editing and including axiom interface. ==== Lower priority issues ==== * Make generic dense polynomial class in pyrex using C arrays to store coefficients? == Notebook/web team == == Other groups add yourselves here == |
