The following is a list of my publications in mathematics and philosophy.
Moir, RHC, Corless, RM, Moreno Maza, M and Xie, N. (2019) “Symbolic-Numeric Integration of Rational Functions.” Numerical Algorithms. (forthcoming)
Asadi, M, Brandt, A, Moir, RHC and Moreno Maza, M. (2019) “Algorithms and Data Structures for Sparse Polynomial Arithmetic.” Mathematics, 7(5), 441 DOI: 10.3390/math7050441
Corless, RM, Kaya, CY and Moir, RHC. (2018) “Optimal residuals and the Dahlquist test problem.” Numerical Algorithms, DOI: 10.1007/s11075-018-0624-x, pp. 1–22.
Fillion, N and Moir, RHC. (2018) “Explanation and Abstraction from a Backward-Error Analytic Perspective.” European Journal for Philosophy of Science, v. 8, no. 3, pp. 735–759, DOI: 10.1007/s13194-018-0208-6.
Bangu, S and Moir RHC (2018). “The ‘Miracle’ of Applicability? The Curious Case of the Simple Harmonic Oscillator.” Foundations of Physics, v. 48, no. 5, pp. 507–525.
Contributed Volume Articles:
Moir, RHC. (2019) “Effective Validity: A Generalized Logic for Approximate Inference.” In: Fillion, Nicolas, Corless, Robert and Kotsireas, Ilias (Eds.), Algorithms and Complexity in Mathematics, Epistemology and Science, Fields Institute Communications, no. 82, pp. 225–268.
Moir, RHC (2018). “Feasible Computation: Methodological Contributions from Computational Science.” In: Cuffaro, M and Fletcher, S (Eds.), Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge University Press, pp. 172–194.
Asadi, M, Brandt, A, Moir, RHC and Moreno Maza, M (2018). “Sparse Polynomial Arithmetic with the BPAS Library.” In: Gerdt V., Koepf W., Seiler W., Vorozhtsov E. (Eds.) Computer Algebra in Scientific Computing. CASC 2018. Lecture Notes in Computer Science, vol 11077.
Moir, RHC. (2013). "Rational Discovery of the Natural World: An Algebro-Geometric Response to Steiner." In: A. Cupillari (Ed.), Proceedings of the Canadian Society for History and Philosophy of Mathematics, Hartford CT, July 2013, pp. 43-59.
PhD Applied Mathematics (with Scientific Computing):
- Moir, RHC (2017). Feasible Computation in Symbolic and Numeric Integration. University of Western Ontario - Electronic Thesis and Dissertation Repository. Paper 5155.
- Moir, RHC (2013). Structures in Real Theory Application: A Study in Feasible Epistemology. University of Western Ontario - Electronic Thesis and Dissertation Repository. Paper 1578.
MSc Applied Mathematics:
- Moir, RHC, Corless, RM, Jeffrey, DJ, (2014). "Unwinding Paths on the Riemann Sphere for Continuous Integrals of Rational Functions". In: Elias, J, Fernández-Sánchez, J, and Sombra, M (Eds.), Proceedings de Encuentro de Álgebra Computacional y Aplicaciones (EACA) XIV (EACA trans: Meeting on Computer Algebra and Applications), Barcelona, June 2014, pp. 139-142.
Chen, C, Covanov, S, Mansouri, F, Moir, RHC, Moreno Maza, M, Xie, N and Xie, Y (2016). “The basic polynomial algebra subprograms.” ACM Communications in Computer Algebra, v. 50, no. 3, pp. 97-100.