Differences between revisions 1 and 47 (spanning 46 versions)
Revision 1 as of 2006-10-11 17:58:25
Size: 1563
Editor: DavidHarvey
Comment: create page
Revision 47 as of 2008-11-14 13:42:09
Size: 1970
Editor: anonymous
Comment: converted to 1.6 markup
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
== Caution ==
Instead of this wiki page the development team now uses Sage's trac installation at http://www.sagetrac.org/sage_trac - please use trac and move open issues there. Changing entries in Sage's trac requires an account, so please contact William Stein ([email protected]) or in #sage-devel if you need an account.
Line 4: Line 7:

David Harvey, Martin Albrecht, Joel Mohler, Robert Bradshaw, William Stein
[[DavidHarvey|David Harvey]], [[Martin_Albrecht]], Joel Mohler, Robert Bradshaw, [[WilliamStein|William Stein]]
Line 8: Line 10:
 * 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.
Line 12: Line 11:
 * Write a benchmarking module.  * Write a benchmarking module or improve on the existing one.
Line 14: Line 13:
 * 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?)
 * Make Algebra {{{_base_ring}}} into a cdef attribute. This will make it possible to give a fast pathway for scalar multiplications.
  * Rewrite polynomials over Z and Z/nZ using direct NTL calls. (''David'')
 * build [[MallocReplacements|omalloc]] as a shared library (or link it statically to memory.so the Pyrex wrapper) and make sure as much stuff as possible uses it (SAGE_malloc macros, GMP, etc.)
Line 22: Line 17:
==== Lower priority issues ====
 * Make generic dense polynomial class in pyrex using C arrays to store coefficients?
Line 25: Line 18:
== Notebook/web team == == 3D Graphics ==
Robert Bradshaw, Alex Clemesha, Robert Miller, Tom Boothby ...
Line 27: Line 21:
== Other groups add yourselves here ==

== Graph Theory Implementation ==
Emily Kirkman, Robert Miller, Bobby Moretti, Tom Boothby

 * [[graph|Main Project Wiki]]

== GSL ==
Josh Kantor, William Stein, Tom Boothby


== Teaching ==
David Joyner, Bobby Moretti

 * Creating functions to teach Fourier series and discrete Fourier transforms on various groups.



== Coding theory ==
David Joyner

 * Wrapping GAP and GUAVA code to support work in error-correcting codes.

== Group theory ==
David Joyner

== Documentation ==
William Stein, David Joyner, [[IftikharBurhanuddin|Iftikhar Burhanuddin]]

== Notebook ==
  [[notebook]]
  * Jason Grout

A page to summarise and coordinate SAGE development activity.

Caution

Instead of this wiki page the development team now uses Sage's trac installation at http://www.sagetrac.org/sage_trac - please use trac and move open issues there. Changing entries in Sage's trac requires an account, so please contact William Stein ([email protected]) or in #sage-devel if you need an account.

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.

  • Write up more entries in WritingFastPyrexCode. (everyone)

  • Write a benchmarking module or improve on the existing one.
  • Optimise pyrex in coercion module.
  • Make Algebra _base_ring into a cdef attribute. This will make it possible to give a fast pathway for scalar multiplications.

    • Rewrite polynomials over Z and Z/nZ using direct NTL calls. (David)

  • build omalloc as a shared library (or link it statically to memory.so the Pyrex wrapper) and make sure as much stuff as possible uses it (SAGE_malloc macros, GMP, etc.)

3D Graphics

Robert Bradshaw, Alex Clemesha, Robert Miller, Tom Boothby ...

Graph Theory Implementation

Emily Kirkman, Robert Miller, Bobby Moretti, Tom Boothby

GSL

Josh Kantor, William Stein, Tom Boothby

Teaching

David Joyner, Bobby Moretti

  • Creating functions to teach Fourier series and discrete Fourier transforms on various groups.

Coding theory

David Joyner

  • Wrapping GAP and GUAVA code to support work in error-correcting codes.

Group theory

David Joyner

Documentation

William Stein, David Joyner, Iftikhar Burhanuddin

Notebook