Search Results - I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms-Algebraic Algorithms

Division-free computation of subresultants using Bezout matrices by Kerber, Michael

“…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L…”
Get full text

Surface representations using blossoms and buds by Yohanes, S.L.

“… The bivariate polynomial b(t,u) is called a bud of the bivariate polynomial p(t,u). An algorithm for finding a bud b(t,u…”
Get full text

Computer algebra and desuspensions of stunted real projective spaces by Nakos, George, Glinos, Nikolaos

“…In this work we apply computer algebra methods to partially solve a geometric problem which arises in algebraic topology…”
Get full text