Resultants of partially composed polynomials

DOI10.1016/j.jsc.2005.10.005zbMath1121.14049OpenAlexW1987986441MaRDI QIDQ2457350

Manfred Minimair

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2005.10.005

zbMATH Keywords

resultantcomposed polynomialutilizing structure for efficient computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic surfaces (14Q10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A chain rule for the resultant of two homogeneous polynomials
• A chain rule for the resultant of two polynomials
• Le formalisme du résultant. (The formalism of resultant)
• Multipolynomial resultant algorithms
• Groebner basis under composition. I
• Reduced Gröbner bases under composition
• Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators
• Product formulas for resultants and Chow forms
• Subresultants under composition
• Sparse resultant under vanishing coefficients
• Dense resultant of composed polynomials: mixed-mixed case
• Generalized resultants over unirational algebraic varieties
• SAGBI bases under composition
• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• Sparse resultant of composed polynomials. II: Unmixed-mixed case.
• Solving degenerate sparse polynomial systems faster
• Resultants of skewly composed polynomials
• Residues and Resultants
• A Chain Rule for Multivariable Resultants
• A subdivision-based algorithm for the sparse resultant
• Explicit formulas for the multivariate resultant.