|
Size: 921
Comment:
|
Size: 1236
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
| * Nick Hale - ''A Brief Introduction to Chebfun'' [[attachment:chebfun_warwick.pdf | slides]] | |
| Line 7: | Line 8: |
| * Simon King - ''How to implement new algebraic structures in Sage: Sage's category and coercion framework'' [[http://sage.math.washington.edu/home/SimonKing/SAGE/How%20to%20implement%20new%20algebraic%20structures%20in%20Sage.sws | short version used here]] and [[http://sagenb.org/home/pub/3837 | original longer version]] | * Simon King - ''How to implement new algebraic structures in Sage: Sage's category and coercion framework'' [[http://sage.math.washington.edu/home/SimonKing/SAGE/How%20to%20implement%20new%20algebraic%20structures%20in%20Sage.sws | short worksheet used at sd35]] and [[http://sagenb.org/home/pub/3837 | original longer one]] * Andy Novocin - ''L1, a quasi-linear LLL algorithm'' [[attachment:novocin_L1.pdf | slides]] |
| Line 9: | Line 11: |
| * Paul Zimmermann - ''CADO-NFS: integer factorization with the Number Field Sieve'' [[attachment:paulsd35.pdf | slides]] |
Slides, worksheets and references for talks at Sage Days 35
Martin Albrecht - M4RI(E) slides
Nick Hale - A Brief Introduction to Chebfun slides
Bill Hart - FLINT slides
Fredrik Johansson - Fast Special Functions slides
Simon King - How to implement new algebraic structures in Sage: Sage's category and coercion framework short worksheet used at sd35 and original longer one
Andy Novocin - L1, a quasi-linear LLL algorithm slides
Arne Storjohann - Some ideas for efficient implementation of algorithms for polynomial matrix computations slides
Paul Zimmermann - CADO-NFS: integer factorization with the Number Field Sieve slides