Generalized resultants over unirational algebraic varieties

DOI10.1006/jsco.1999.0304zbMath0983.14039OpenAlexW2016691347MaRDI QIDQ1569828

Laurent Busé, Mohamed Elkadi, Mourrain, Bernard

Publication date: 28 September 2000

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

Full work available at URL: https://hal.inria.fr/inria-00096842/file/main.pdf

zbMATH Keywords

resultantBezoutian matricesparametrized varietiesunirational algebraic varieties

Mathematics Subject Classification ID

Computational aspects of algebraic surfaces (14Q10) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Rational and unirational varieties (14M20)

Related Items

Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Overdetermined systems of equations on toric, spherical, and other algebraic varieties ⋮ Sparse resultant under vanishing coefficients ⋮ Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry ⋮ Bezoutian and quotient ring structure ⋮ Flexibility of Bricard's linkages and other structures via resultants and computer algebra ⋮ Resultants of partially composed polynomials ⋮ Heuristics to accelerate the Dixon resultant ⋮ Comparing acceleration techniques for the Dixon and Macaulay resultants ⋮ Resultant over the residual of a complete intersection. ⋮ Image analysis: identification of objects via polynomial systems ⋮ Algorithmic Search for Flexibility Using Resultants of Polynomial Systems ⋮ The \(q\)-numerical range of 3-by-3 weighted shift matrices ⋮ Intersection and self-intersection of surfaces by means of Bezoutian matrices ⋮ Cayley-Dixon projection operator for multi-univariate composed polynomials ⋮ Sparse resultant of composed polynomials. I: Mixed-unmixed case. ⋮ Sparse resultant of composed polynomials. II: Unmixed-mixed case. ⋮ Conic tangency equations and Apollonius problems in biochemistry and pharmacology ⋮ Algebraic methods and arithmetic filtering for exact predicates on circle arcs ⋮ Heuristics to sift extraneous factors in Dixon resultants

Uses Software

• Maple

Cites Work

• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• Le formalisme du résultant. (The formalism of resultant)
• Multipolynomial resultant algorithms
• Computing the isolated roots by matrix methods
• Product formulas for resultants and Chow forms
• Algorithms for residues and Łojasiewicz exponents
• Multivariate subresultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized resultants over unirational algebraic varieties