Computer Algebra Group at Simon Fraser

Text Size: ππππ
2017 Preprints 2016 Preprints 2015 Preprints 2014 Preprints 2013 Preprints 2012 Preprints 2011 Preprints 2010 Preprints 2009 Preprints 2008 Preprints 2007 Preprints 2006 Preprints 2005 Preprints 2004 Preprints 2003 Preprints 2002 Preprints 2001 Preprints 2000 Preprints Earliest Preprints

Computational Algebra Group at SFU


2005 Preprints

J. de Kleine, M. Monagan, A. Wittkopf. Algorithms for the Non-Monic Case of the Sparse Modular GCD Algorithm.
January 2005 [ PDF ] [ PostScript ]

Ha Le, Ziming Li. On a Set of Hyperexponential Elements and Fast Versions of Zeilberger's Algorithm.
January 2005 [ PDF ] [ PostScript ]

S. A. Abramov, H. Q. Le, Z. Li. Univariate Ore Polynomial Rings in Computer Algbra.
Journal of Mathematical Sciences, 2005. [ PDF ]

S. A. Abramov, H. Q. Le. On the order of the recurrence produced by the method of creative telescoping.
Discrete Mathematics, 2005. [ PDF ]

Keld Bak, Stephan Sauer, Jens Oddershede, and John Ogilvie. The vibrational g-factor of dihydrogen from theoretical calculation and analysis of vibrational-rotational spectra.
May 2005 [ PDF ]

Jeffrey B. Farr and Roman Pearce. Working with Multivariate Polynomials in Maple.
May 2005 [ PDF ] [ PostScript ]

S. Lo, M. Monagan, A. Wittkopf. A Modular Algorithm for Computing the Characteristic Polynomial of an Integer Matrix in Maple.
May 2005 [ PDF ] [ PostScript ]
Maple code for computing strongly connected components: [ txt ]
Maple input files (.txt format) for the [ 72 by 72 ] matrix, the [ 364 by 364 ] matrix, and the [ 1916 by 1916 ] matrix.

M. Ebrahimi, and M. Monagan. New options to visualize systems of differential equations in Maple.
May 2005 [ PDF ] [ PostScript ]

J. Farr, M. Khatirinejad, S. Khodadad, M. Monagan. A Graph Theory Package for Maple.
May 2005 [ PDF ] [ PostScript ]

Michael Monagan. Probabilistic Algorithms for Resultants.
May 2005 [ PDF ] [ PostScript ]

Roman Pearce. Rational Expression Simplification with Polynomial Side Releations.
MSc. Thesis, Simon Fraser University, August 2005. [ PDF ]

M. B. Monagan and M. van Hoeij. A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions.
November 2005 [ PDF ]

Back to the CAG Home Page.