I am a research associate at Simon Fraser University and a member of the Computer Algebra Group at the CECM. My expertise is high performance parallel programming, asychronous algorithms, sparse polynomials, linear algebra, and Groebner bases.
The sdmp library for sparse multivariate polynomial arithmetic is the state of the art. It is being integrated into the Maple computer algebra system.
This is joint work with Michael Monagan at Simon Fraser University. It is sponsored by the MITACS NCE and NSERC of Canada, and Maplesoft.
Current release: in Maple 16 (old benchmarks)
In development: Maple data structure
Parallel Sparse Polynomial Powering Using Heaps submitted to ISSAC 2012
Parallel Sparse Polynomial Division Using Heaps presented at PASCO 2010
Parallel Sparse Polynomial Multiplication Using Heaps presented at ISSAC 2009
Sparse Polynomial Division Using a Heap in the Journal of Symbolic Computation.
Polynomial Division using Dynamic Arrays, Heaps, and Packed Exponent Vectors presented at CASC 2007.
Rational Expression Simplification Modulo a Polynomial Ideal presented at ISSAC 2006.
Maple 16: parallel division, heap efficiency gains
Maple 15: powering algorithms, Kronecker substitution, Zp multiprecision
Maple 14: sdmp Z/Q
Maple 13: sdmp Zp, dense linear solver
Maple 12: sparse linear solver over Q
Maple 11: current Groebner package, improved simplify with side relations
Maple 10: PolynomialIdeals package
You can find me on MaplePrimes.
Feel free to drop me a line, rpearcea at cecm dot sfu dot ca.