Sage Days 24 Coding Sprint Projects

This is a list of projects suitable for Sage Days 24. Feel free to add your favourite ideas/wishes, and to put your name down for something you're interested in (you'll need to get an account on the wiki to do this).

Contents

  1. Sage Days 24 Coding Sprint Projects
    1. Kovacic's Algorithm
    2. Hypergeometric Functions
    3. Plural support
    4. Locapal support
    5. Parallel Integration
    6. Algorithmic/Automatic Differentiation
    7. Upgrade Pari to version 2.4.3
    8. Function Fields
    9. Fast linear algebra over small extensions of GF(2)
    10. Generating Stuff

Kovacic's Algorithm

People: Burcin Erocal, Felix

Implement Kovacic's algorithm in Sage.

Hypergeometric Functions

People: Flavia Stan, Karen Kohl, Fredrik Johansson, Zaf

Plural support

People: Burcin Erocal, Simon King, Alex, Alex D., Burkhard

Add support for Singular's noncommutative component Plural, finish #4539.

Locapal support

People: Burcin Erocal

There is experimental support for computing Groebner bases over certain localizations of operator algebras in Singular. See this presentation for more details. Support for arithmetic needs to be provided in Sage.

Parallel Integration

People: Stefan Boethner, Ralf, Burkhard, Burcin Erocal

Integrate Stefan Boettner's parallel integration code in Sage. There are several prerequisites for this, such as

Algorithmic/Automatic Differentiation

People: William Stein

I never thought much of this topic, but there is a talk at Euroscipy suggesting it could be useful. More details here.

Upgrade Pari to version 2.4.3

People: William Stein

See trac 9343. This has little to do with symbolic computation though...

Function Fields

The goal of this project is to get the basic infrastructure for function fields into Sage. See Hess's papers and talks.

People: William Stein, Sebastian P.

Make sure to see this page for more links.

Fast linear algebra over small extensions of GF(2)

People: Martin Albrecht, Ciaran Mullan, Robert Miller, Sebastian P., Thomas

Here is how long Sage currently takes to compute the reduced row echelon form over GF(2^4) on a Macbook Pro (2nd generation): 

----------------------------------------------------------------------
| Sage Version 4.4.3, Release Date: 2010-06-04                       |
| Type notebook() for the GUI, and license() for information.        |
----------------------------------------------------------------------
sage: for i in range(1000,3001,1000):
    A = random_matrix(GF(2^4,'a'),i,i)
    t = cputime()
    E = A.echelon_form()
    print i, cputime(t)
....:
1000 49.49
2000 429.05
3000 1494.33

Here's how much NTL could improve things (only upper triangular not RREF): 

sage: K.<a> = GF(2^4)
sage: for i in (1000,2000,3000):
    A = ntl.mat_GF2E(K,i,i)
    A.randomize()
    t = cputime()
    _ = A.gauss()
    print "%5d, %7.2f"%(i,cputime(t))
....:     
 1000,   18.84
 2000,  149.11
 3000,  526.57

Here is how long Magma takes for the same task on a Xeon: 

Magma V2.16-11    Sat Jul 17 2010 05:06:30 on eno      [Seed = 1246196891]
Type ? for help.  Type <Ctrl>-D to quit.
> K<a> := GF(2^4);
> for i := 1000 to 10001 by 1000 do
for> A:=RandomMatrix(K,i,i);
for> t:=Cputime();
for> E:=EchelonForm(A);
for> print i, Cputime(t);
for>
for> end for;
1000 0.090
2000 0.510
3000 1.640

Finally, here is how long some proof of concept code (written on the train ride to Linz) takes (cf. http://bitbucket.org/malb/m4rie ): 

gf(2^4), 1000 x 1000: wall time: 0.097
gf(2^4), 2000 x 2000: wall time: 0.529
gf(2^4), 3000 x 3000: wall time: 2.315

Note that over GF(2^8) this code is already faster than Magma 

> K<a> := GF(2^8);
> for i := 1000 to 10001 by 1000 do
for> A:=RandomMatrix(K,i,i);
for> t:=Cputime();
for> E:=EchelonForm(A);
for> print i, Cputime(t);
for> end for;
1000 1.290
2000 9.870
3000 33.560

gf(2^8), 1000 x 1000: wall time: 0.865
gf(2^8), 2000 x 2000: wall time: 4.306
gf(2^8), 3000 x 3000: wall time: 14.029

Generating Stuff

People: Robert Miller