Sparse resultant of composed polynomials. II: Unmixed-mixed case.

DOI10.1006/JSCO.2001.0517MaRDI QIDQ1600043zbMATH OpenOpenAlexFDO

Authors Manfred Minimair

Publication date 11 June 2002

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

Full work available at URL https://doi.org/10.1006/jsco.2001.0517

zbMATH Keywords

efficiencycomposed polynomialscomputing sparse resultants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Numerical computation of solutions to systems of equations (65H10) Polynomials, factorization in commutative rings (13P05)

Recommendations

• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• Dense resultant of composed polynomials: mixed-mixed case
• scientific article; zbMATH DE number 2151202
• scientific article; zbMATH DE number 1263319
• scientific article; zbMATH DE number 503188

Cites work

• scientific article; zbMATH DE number 27181 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1253976 (Why is no real title available?)
• scientific article; zbMATH DE number 1253983 (Why is no real title available?)
• scientific article; zbMATH DE number 1256734 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 578220 (Why is no real title available?)
• A Chain Rule for Multivariable Resultants
• A subdivision-based algorithm for the sparse resultant
• Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators
• Generalized resultants over unirational algebraic varieties
• Groebner basis under composition. I
• Le formalisme du résultant. (The formalism of resultant)
• Multipolynomial resultant algorithms
• Product formulas for resultants and Chow forms
• Residues and Resultants
• Solving degenerate sparse polynomial systems faster
• Subresultants under composition

Cited in

(10)

• Sparse resultant under vanishing coefficients
• Resultants of skewly composed polynomials
• scientific article; zbMATH DE number 671748 (Why is no real title available?)
• Dense resultant of composed polynomials: mixed-mixed case
• Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
• Cayley-Dixon projection operator for multi-univariate composed polynomials
• scientific article; zbMATH DE number 2151202 (Why is no real title available?)
• Rational univariate reduction via toric resultants
• Resultants of partially composed polynomials
• Sparse resultant of composed polynomials. I: Mixed-unmixed case.

This page was built for publication: Sparse resultant of composed polynomials. II: Unmixed-mixed case.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600043)