Hybrid sparse resultant matrices for bivariate polynomials
From MaRDI portal
Publication:697484
DOI10.1006/jsco.2002.0524zbMath1021.65024OpenAlexW2050711638WikidataQ57908783 ScholiaQ57908783MaRDI QIDQ697484
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
Newton polygonsbivariate polynomialsMAPLE implementationhybrid sparse resultant matricessubmatrix of Sylvester typetoric Jacobian
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
The resultant of an unmixed bivariate system ⋮ Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation ⋮ A matrix-based approach to properness and inversion problems for rational surfaces ⋮ Multihomogeneous resultant formulae for systems with scaled support ⋮ On the geometry of parametrized bicubic surfaces ⋮ Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Newton polytope of the resultant
- Inertia forms and resultant: A formulary
- On the complexity of sparse elimination
- Macaulay style formulas for sparse resultants
- Hybrid sparse resultant matrices for bivariate systems
- Rectangular corner cutting and Sylvester A-resultants
- Residues in Toric Varieties
- Residues and Resultants
- A subdivision-based algorithm for the sparse resultant
- An implicitization algorithm for rational surfaces with no base points
This page was built for publication: Hybrid sparse resultant matrices for bivariate polynomials
