Hybrid sparse resultant matrices for bivariate polynomials

DOI10.1006/JSCO.2002.0524MaRDI QIDQ697484zbMATH OpenOpenAlexWikidataFDO

Authors Carlos D'Andrea, Ioannis Z. Emiris

Publication date 17 September 2002

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

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

zbMATH Keywords

bivariate polynomialshybrid sparse resultant matricesMAPLE implementationNewton polygonssubmatrix of Sylvester typetoric Jacobian

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10)

Review text

The authors investigate three bivariate polynomials whose Newton polygons are scaled copies of a single polygon and construct the square resultant matrices. The matrix is hybrid in that it contains a submatrix of Sylvester type and an additional row expressing the toric Jacobian. They also illustrate their constructions using MAPLE implementation.

Recommendations

• Hybrid sparse resultant matrices for bivariate systems
• The resultant of an unmixed bivariate system
• scientific article; zbMATH DE number 2151229
• Matrices in elimination theory
• Entry formula for mixed resultant matrix of bivariate polynomial system

Cites work

• A subdivision-based algorithm for the sparse resultant
• An implicitization algorithm for rational surfaces with no base points
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 2151229 (Why is no real title available?)
• Hybrid sparse resultant matrices for bivariate systems
• Inertia forms and resultant: A formulary
• Macaulay style formulas for sparse resultants
• On the complexity of sparse elimination
• On the Newton polytope of the resultant
• Rectangular corner cutting and Sylvester \(\mathcal{A}\)-resultants
• Residues and Resultants
• Residues in Toric Varieties

Cited in

(11)

• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• The resultant of an unmixed bivariate system
• On the geometry of parametrized bicubic surfaces
• Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
• Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
• Entry formula for mixed resultant matrix of bivariate polynomial system
• Hybrid sparse resultant matrices for bivariate systems
• scientific article; zbMATH DE number 1487783 (Why is no real title available?)
• Sylvester-resultants for bivariate polynomials with planar newton polygons
• scientific article; zbMATH DE number 2151229 (Why is no real title available?)
• A matrix-based approach to properness and inversion problems for rational surfaces

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Hybrid sparse resultant matrices for bivariate polynomials

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