A vectorial approach to generalize the remainder theorem
Abstract
Later, starting from the previous theorems, we obtain some algorithms that calculate the pseudo-remainder and the pseudo-quotient while avoiding long division.
Finally, we provide examples and comparisons indicating that these algorithms are efficient in divisions by sparse polynomials and their divisors, as cyclotomic polynomials.
Full Text:
PDFReferences
D. Bini and V. Pain, Polynomial Division and Its Computational Complexity, Journal of Complexity 2 (1986), 179-203.
K.O. Geddes, S.R. Czapor, and G. Labahn, Algorithms for Computer Algebra (3rd ed), Kluwer Academic Publisher, 1992.
D.E. Knuth, The Art of Computer Programming Vol 2 Seminumerical algorithm (3rd ed), Addison-Wesley, 1998.
F. Laudano, A generalization of the remainder theorem and factor theorem, Int J Math Educ Sci Technol. 50 (2019), no. 6, 960-967. https://10.1080/0020739X.2018.1522676
F. Richman, A division algorithm, Journal of Algebra and Its Applications 4 (2005), no. 4, 441-449. https://doi.org/10.1142/S0219498805001289
J.J. Rotman, Advanced Modern Algebra, Prentice-Hall, 2003.
J. von zur Gathen and J. Gerhard, Modern Computer Algebra (Third edition), Cambridge University Press, 2013.
https://it.mathworks.com/help/matlab/ref/deconv.html#bvjpzjj-1
DOI: https://doi.org/10.52846/ami.v49i1.1478