Collaborative works

Research articles

We list below research articles written by at least two members of our lab belonging to different supervisor teams. Thus, those papers highlight the interactions between the members of ORCCA at UWO. This list covers the period 1999-2016. The complete list of all papers written by ORCCA members from either UWO or UW can be found at the ORCCA under research

[1] Parisa Alvandi, Marc Moreno Maza, Éric Schost, and Paul Vrbik. A standard basis free algorithm for computing the tangent cones of a space curve. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 17th International Workshop, CASC 2015, Aachen, Germany, September 14-18, 2015, Proceedings, volume 9301 of Lecture Notes in Computer Science, pages 45-60. Springer, 2015. [ DOI | http ]
[2] Silvana Ilie, David J. Jeffrey, Robert M. Corless, and X. Zhang. Computation of stirling numbers and generalizations. In Laura Kovács, Viorel Negru, Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, and Daniela Zaharie, editors, 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015, pages 57-60. IEEE Computer Society, 2015. [ DOI | http ]
[3] Parisa Alvandi, Changbo Chen, Steffen Marcus, Marc Moreno Maza, Éric Schost, and Paul Vrbik. Doing algebraic geometry with the regularchains library. In Hoon Hong and Chee Yap, editors, Mathematical Software - ICMS 2014 - 4th International Congress, Seoul, South Korea, August 5-9, 2014. Proceedings, volume 8592 of Lecture Notes in Computer Science, pages 472-479. Springer, 2014. [ DOI | http ]
[4] Robert M. Corless, David J. Jeffrey, and Fei Wang. The asymptotic analysis of some interpolated nonlinear recurrence relations. In Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, and Ágnes Szántó, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014, pages 115-121. ACM, 2014. [ DOI | http ]
[5] Changbo Chen, Robert M. Corless, Marc Moreno Maza, Pei Yu, and Yiming Zhang. An application of regular chain theory to the study of limit cycles. I. J. Bifurcation and Chaos, 23(9), 2013. [ DOI | http ]
[6] Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. The modpn library: Bringing fast polynomial arithmetic into maple. J. Symb. Comput., 46(7):841-858, 2011. [ DOI | http ]
[7] Xin Li, Marc Moreno Maza, and Éric Schost. Fast arithmetic for triangular sets: From theory to practice. J. Symb. Comput., 44(7):891-907, 2009. [ DOI | http ]
[8] Robert M. Corless, Karin Gatermann, and Ilias S. Kotsireas. Using symmetries in the eigenvalue method for polynomial systems. J. Symb. Comput., 44(11):1536-1550, 2009. [ DOI | http ]
[9] Xin Li, Marc Moreno Maza, Raqeeb Rasheed, and Éric Schost. High-performance symbolic computation in a hybrid compiled-interpreted programming environment. In Marina L. Gavrilova, Osvaldo Gervasi, Antonio Laganà, Youngsong Mun, and Andrés Iglesias, editors, Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, ICCSA '08, Perugia, Italy, June 30 - July 3, 2008, pages 331-341. IEEE Computer Society, 2008. [ DOI | http ]
[10] Songxin Liang, David J. Jeffrey, and Marc Moreno Maza. The complete root classification of a parametric polynomial on an interval. In J. Rafael Sendra and Laureano González-Vega, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pages 189-196. ACM, 2008. [ DOI | http ]
[11] R. Rasheed X. Li, M. Moreno Maza and É. Schost. High-performance symbolic computation in a hybrid compiled-interpreted programming environment. Proceedings of International Conference on Computational Sciences and Its Applications, pages 331-341. IEEE Computer Society, 2008, 2008. [ .pdf ]
[12] M. Moreno Maza and S. M. Watt. Mica '08: Proceedings of milestones in computer algebra 2008: A conference in honour of keith geddes' 60th birthday edited by. ISBN 978-0-7714-2682-7, Trinidad and Tobago, 217 pages, 2008, 2008. [ .pdf ]
[13] Marc Moreno Maza, Gregory J. Reid, Robin Scott, and Wenyuan Wu. On approximate triangular decompositions in dimension zero. J. Symb. Comput., 42(7):693-716, 2007. [ DOI | http ]
[14] Xin Li, Marc Moreno Maza, and Éric Schost. On the virtues of generic programming for symbolic computation. In Yong Shi, G. Dick van Albada, Jack Dongarra, and Peter M. A. Sloot, editors, Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part II, volume 4488 of Lecture Notes in Computer Science, pages 251-258. Springer, 2007. [ DOI | http ]
[15] Marc Moreno Maza, Ben Stephenson, Stephen M. Watt, and Yuzhen Xie. Multiprocessed parallelism support in ALDOR on smps and multicores. In Marc Moreno Maza and Stephen M. Watt, editors, Parallel Symbolic Computation, PASCO 2007, International Workshop, 27-28 July 2007, University of Western Ontario, London, Ontario, Canada, pages 60-68. ACM, 2007. [ DOI | http ]
[16] Xin Li, Marc Moreno Maza, and Éric Schost. Fast arithmetic for triangular sets: from theory to practice. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 269-276. ACM, 2007. [ DOI | http ]
[17] Marc Moreno Maza and Stephen M. Watt, editors. Parallel Symbolic Computation, PASCO 2007, International Workshop, 27-28 July 2007, University of Western Ontario, London, Ontario, Canada. ACM, 2007.
[18] D.J. Jeffrey, R.M. Corless, and Leslie. “linear algebra in maple". CRC Handbook of Linear Algebra, 2007.
[19] M. Moreno Maza M. Bronstein and S.M. Watt. Generic programming techniques in aldor. Proceedings of the Fifth Asian Workshop on Foundations of Software, pages 72-77, University of Xiamen, China,, 2007. [ .pdf ]
[20] M. Moreno Maza M. Bronstein and S.M. Watt. Generic programming techniques in aldor. Proceedings of the Fifth Asian Workshop on Foundations of Software, pages 72-77, University of Xiamen, China, 2007, 2007. [ .pdf ]
[21] R. Scott M. Moreno Maza, G. Reid and W. Wu. On approximate linearized triangular decompositions. book chapter of Advances on Symbolic-Numeric Computation, edited by D. M. Wang and L. Zhi, p. 268-287, Springer,, 2007. [ .pdf ]
[22] R. Scott M. Moreno Maza, G. Reid and W. Wu. On approximate linearized triangular decompositions. book chapter of Advances on Symbolic-Numeric Computation, edited by D. M. Wang and L. Zhi, p. 268-287, Springer, 2007, 2007. [ .pdf ]
[23] Robert M. Corless, Hui Ding, and David J. Jeffrey. The solution of s exp(s) = a is not always the lambert w function of a. In Dongming Wang, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pages 116-121. ACM, 2007. [ DOI | http ]
[24] X. Dahan, M. Moreno Maza, É. Schost, , and Y. Xie. On the complexity of the d5 principle. Proceedings of Transgressive Computing 2006, J.-G. Dumas et al., editors, Granada, Spain, 2006, 2006. [ .pdf ]
[25] X. Dahan, X. Jin, M. Moreno Maza, and É Schost. Change of ordering for regular chains in positive dimension. Proceedings of Algebraic Geometry and Geometric Modelling'06, pages 49-53, Universidad de Barcelona, 2006, 2006. [ .pdf ]
[26] M. Moreno Maza, É. Schost, , and W. Zhou. Primary decomposition of zero-dimensional ideals: Putting monico's algorithm into practice. Proceedings of Transgressive Computing 2006, J.-G. Dumas et al., editors, Granada, Spain, 2006, 2006. [ .pdf ]
[27] Akpodigha Filatei, Xin Li, Marc Moreno Maza, and Éric Schost. Implementation techniques for fast polynomial arithmetic in a high-level programming environment. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 93-100. ACM, 2006. [ DOI | http ]
[28] Silvana Ilie, Robert M. Corless, and Greg Reid. Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time. Numerical Algorithms, 41(2):161-171, 2006. [ DOI | http ]
[29] Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, and Yuzhen Xie. Lifting techniques for triangular decompositions. In Manuel Kauers, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pages 108-115. ACM, 2005. [ DOI | http ]
[30] M. Moreno Maza, G. Reid, R. Scott, and W. Wu. On approximate triangular decompsoitions i. dimension zero. Proceedings of Symbolic-Numeric Computation'05, D. M. Wang and L. Zhi editors, Xi'an, China, 2005, 2005. [ .pdf ]
[31] M. Moreno Maza, G. Reid, R. Scott, and W. Wu. On approximate triangular decompositions ii. linear systems. Proceedings of Symbolic-Numeric Computation'05, D. M. Wang and L. Zhi editors, Xi'an, China, 2005, 2005. [ .pdf ]
[32] Wenqin Zhou, David J. Jeffrey, and Gregory J. Reid. An algebraic method for analyzing open-loop dynamic systems. In Vaidy S. Sunderam, G. Dick van Albada, Peter M. A. Sloot, and Jack Dongarra, editors, Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part III, volume 3516 of Lecture Notes in Computer Science, pages 586-593. Springer, 2005. [ DOI | http ]
[33] R.M. Corless and S.M. Watt. “bernstein bases are optimal, but, sometimes, lagrange bases are better,”. Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 141-152, 2004.
[34] Robert M. Corless, Stephen M. Watt, and Lihong Zhi. QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Processing, 52(12):3394-3402, 2004. [ DOI | http ]
[35] M. Moreno Maza J. Cai, M. Dunstan and S Watt. Debugging aldor via a unified runtime environment. Proceedings of EACA'04, Universidad de Santander, Spain, 2004, 2004. [ .ps ]
[36] M. Moreno Maza J. Cai, M. Dunstan and S Watt. Debugging a high level language via a unified interpreter and compiler runtime environment. Proceedings of ACA'04, University of Texas at Beaumont, USA, 2004, 2004. [ .ps ]
[37] Wenqin Zhou, David J. Jeffrey, Gregory J. Reid, Chad Schmitke, and John McPhee. Implicit reduced involutive forms and their application to engineering multibody systems. In Hongbo Li, Peter J. Olver, and Gerald Sommer, editors, Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, volume 3519 of Lecture Notes in Computer Science, pages 31-43. Springer, 2004. [ DOI | http ]
[38] Russell J. Bradford, Robert M. Corless, James H. Davenport, David J. Jeffrey, and Stephen M. Watt. Reasoning about the elementary functions of complex analysis. Ann. Math. Artif. Intell., 36(3):303-318, 2002. [ DOI | http ]
[39] Robert M. Corless and David J. Jeffrey. The wright omega function. In Jacques Calmet, Belaid Benhamou, Olga Caprotti, Laurent Henocque, and Volker Sorge, editors, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Joint International Conferences, AISC 2002 and Calculemus 2002, Marseille, France, July 1-5, 2002, Proceedings, volume 2385 of Lecture Notes in Computer Science, pages 76-89. Springer, 2002. [ DOI | http ]
[40] Robert M. Corless, André Galligo, Ilias S. Kotsireas, and Stephen M. Watt. A geometric-numeric algorithm for absolute factorization of multivariate polynomials. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 37-45. ACM, 2002. [ DOI | http ]
[41] Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, and Stephen M. Watt. Towards factoring bivariate approximate polynomials. In Erich Kaltofen and Gilles Villard, editors, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pages 85-92. ACM, 2001. [ DOI | http ]
[42] Robert M. Corless, James H. Davenport, David J. Jeffrey, Gurjeet Litt, and Stephen M. Watt. Reasoning about the elementary functions of complex analysis. In John A. Campbell and Eugenio Roanes-Lozano, editors, Artificial Intelligence and Symbolic Computation, International Conference AISC 2000 Madrid, Spain, July 17-19, 2000, Revised Papers, volume 1930 of Lecture Notes in Computer Science, pages 115-126. Springer, 2000. [ DOI | http ]
[43] Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, and Stephen M. Watt. Numerical implicitization of parametric hypersurfaces with linear algebra. In John A. Campbell and Eugenio Roanes-Lozano, editors, Artificial Intelligence and Symbolic Computation, International Conference AISC 2000 Madrid, Spain, July 17-19, 2000, Revised Papers, volume 1930 of Lecture Notes in Computer Science, pages 174-183. Springer, 2000. [ DOI | http ]
[44] Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, and Stephen M. Watt. Approximate polynomial decomposition. In Keith O. Geddes, Bruno Salvy, and Samuel S. Dooley, editors, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999, pages 213-219. ACM, 1999. [ DOI | http ]

Home