Roman Pearce

Who Am I?

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, sparse polynomials, linear algebra, and Groebner bases.

I live in Abbotsford, British Columbia, Canada.

Sparse Distributed Multivariate Polynomials

Sdmp is a state of the art library for sparse multivariate polynomial arithmetic. It is used by 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.


A Compact Parallel Implementation of F4 presented at PASCO 2015

The design of Maple’s sum-of-products and POLY data structures for representing mathematical objects

POLY: a new polynomial data structure for Maple 17 demonstrated at ISSAC 2012

Sparse Polynomial Powering Using Heaps presented at CASC 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.

Features in Maple

Maple 18: poly improvements, sparse powering

Maple 17: poly data structure and algorithms

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 also find me on MaplePrimes.

Feel free to drop me a line. My work address is rpearcea at cecm dot sfu dot ca.