| [1] |
S.A. Abramov and H.Q. Le.
The sequence of linear algebraic systems generated by Zeilberger's
algorithm, 2003.
To appear in FPSAC'2003. [ bib ] |
| [2] |
S.A. Abramov, H.Q. Le, and Z. Li.
Univariate Ore polynomial rings in computer algebra.
Journal of Mathematical Sciences, a translation of selected
Russian-language serial publications in Mathematics, 2003.
Submitted. [ bib ] |
| [3] |
S.A. Abramov, H.Q. Le, and Z. Li.
Univariate Ore polynomial rings in computer algebra.
Technical Report CS-2003-12, School of Computer Science, University
of Waterloo, 2003. [ bib ] |
| [4] |
S.A. Abramov, H.Q. Le, and M. Petkovsek.
Rational canonical forms and efficient representations of
hypergeometric terms.
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 7-14. ACM Press, New York, 2003. [ bib ] |
| [5] |
Victor S. Adamchik and David J. Jeffrey.
Polynomial transformations of Tschirnhaus, Bring, and Jerrard.
SIGSAM Bulletin, 37(3):90-93, 2003. [ bib ] |
| [6] |
R.F. Burger, G. Labahn, and M. van Hoeij.
Closed form solutions of linear ODEs having doubly periodic
coefficients.
Journal of Symbolic Computation, 2002.
Submitted. [ bib ] |
| [7] |
Frederick W. Chapman.
Generalized Orthogonal Series for Natural Tensor Product
Interpolation.
Ph.D. thesis, University of Waterloo, Waterloo, Canada,
2003. [ bib ] |
| [8] |
Frederick W. Chapman.
An elementary algorithm for the automatic derivation and proof of
tensor product identities via computer algebra.
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 50-57. ACM Press, New York, 2003. [ bib ] |
| [9] |
W. Eberly and M. Giesbrecht.
Efficient decomposition of separable algebras.
Journal of Symbolic Computation, 37:35-81, 2004. [ bib ] |
| [10] |
G. Egorychev and E. Zima.
Decomposition and group theoretic characterization of pairs of
inverse relations of the Riordan type.
In Proc. Intern. Conference on Algebra and its Applications,
Krasnoyarsk, August 2002. Kluwer. [ bib ] |
| [11] |
K.O. Geddes and W.W. Zheng.
Exploiting fast hardware floating point in high precision
computation.
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 111-118. ACM Press, New York, 2003. [ bib ] |
| [12] |
J. Gerhard, M.W. Giesbrecht, A. Storjohann, and E.V. Zima.
Shiftless decompositiion and polynomial-time rational summation.
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 119-126. ACM Press, New York, 2003. [ bib ] |
| [13] |
Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee.
Algorithms for computing sparsest shifts of polynomials in power,
Chebyshev, and Pochhammer bases.
Journal of Symbolic Computation, 36:401-424, September-October
2003. [ bib ] |
| [14] |
M. Giesbrecht, A. Storjohann, and G. Villard.
Algorithms for matrix canonical forms.
In V. Weispfennig J. Grabmeier, E. Kaltofen, editor, Handbook of
Computer Algebra, chapter 2.3.2, pages 38-41. Springer Verlag, Heidelberg,
2003. [ bib ] |
| [15] |
M. Giesbrecht and Y. Zhang.
Factoring and decomposing Ore polynomials over Fq(t).
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 127-134. ACM Press, New York, 2003. [ bib ] |
| [16] |
K. Hazaveh, D.J. Jeffrey, G.J. Reid, S.M. Watt, and A.D. Wittkopf.
An exploration of homotopy solving in Maple.
In Ziming Li and William Sit, editors, Lecture Notes Series on
Computing, Singapore/River Usa, 2003. World Scientific Publ.
Proceedings of the Sixth Asian Symposium (ASCM). [ bib ] |
| [17] |
Erich Kaltofen and Wen-shin Lee.
Early termination in sparse interpolation algorithms.
Journal of Symbolic Computation, 36:365-400, September-October
2003. [ bib ] |
| [18] |
Ha Le.
Algorithms for the Construction of the Minimal Telescopers.
Ph.D. thesis, University of Waterloo, Waterloo, Canada,
2003. [ bib ] |
| [19] |
Z. Li, F. Schwarz, and S.P. Tsarev.
Factoring systems of linear PDEs with finite-dimensional solution
spaces.
Journal of Symbolic Computation, 36:443-471, 2003. [ bib ] |
| [20] |
M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S.M. Vorkoetter, J. McCarron,
and P. DeMarco.
Maple 9 Introductory Programming Guide.
Waterloo Maple Inc., Waterloo, Ontario, Canada, 2003.
388 pages. [ bib ] |
| [21] |
M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S.M. Vorkoetter, J. McCarron,
and P. DeMarco.
Maple 9 Advanced Programming Guide.
Waterloo Maple Inc., Waterloo, Ontario, Canada, 2003.
444 pages. [ bib ] |
| [22] |
T. Mulders and A. Storjohann.
On lattice reduction for polynomial matrices.
Journal of Symbolic Computation, 35(4):377-401, 2003. [ bib ] |
| [23] |
G. Reid, J. Tang, and L. Zhi.
A complete symbolic-numeric linear method for camera pose
determination.
In J.R. Sendra, editor, ACM International Symposium on Symbolic
and Algebraic Computation, pages 215-223. ACM Press, New York, 2003. [ bib ] |
| [24] |
Azar Shakoori.
An exploration of Bézout matrices for solving bivariate
polynomials.
M.Sc. thesis, University of Western Ontario, London,
Canada, January 2003. [ bib ] |
| [25] |
A. Storjohann.
High-order lifting and integrality certification.
Journal of Symbolic Computation, 36(3-4):613-648, 2003. [ bib ] |
| [26] |
Josh Taylor.
The Meijer G method of integration.
M.Math. essay, University of Waterloo, Waterloo, Canada,
September 2003. [ bib ] |