Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Multipolynomial resultant algorithms
Journal of Symbolic Computation
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Subresultants under composition
Journal of Symbolic Computation
Extraneous factors in the Dixon resultant formulation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Groebner basis under composition I
Journal of Symbolic Computation
Reduced Gro¨bner bases under composition
Journal of Symbolic Computation
Solving degenerate sparse polynomial systems faster
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Solving the recognition problem for six lines using the Dixon resultant
Mathematics and Computers in Simulation - Special issue on high performance symbolic computing
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Journal of Symbolic Computation
Sparse resultant of composed polynomials I* mixed-unmixed case
Journal of Symbolic Computation
Sparse resultant of composed polynomials II unmixed--mixed case
Journal of Symbolic Computation
Factoring sparse resultants of linearly combined polynomials
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Sparse Resultant under Vanishing Coefficients
Journal of Algebraic Combinatorics: An International Journal
Dense resultant of composed polynomials mixed-mixed case
Journal of Symbolic Computation
Hi-index | 0.00 |
We study the structure of resultants of two homogeneous partially composed polynomials. By two homogeneous partially composed polynomials we mean a pair of polynomials of which one does not have any given composition structure and the other is obtained by composing a bivariate homogeneous polynomial with two bivariate homogeneous polynomials. The main contributions are two equivalent formulas, each representing the resultant of two partially composed polynomials as a certain iterated resultant of the component polynomials. Furthermore, in many cases, this iterated resultant can be computed with dramatically increased efficiency, as demonstrated by experiments.