Hybrid sparse resultant matrices for bivariate polynomials
From MaRDI portal
Publication:697484
Recommendations
Cites work
- 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?)
- A subdivision-based algorithm for the sparse resultant
- An implicitization algorithm for rational surfaces with no base points
- Hybrid sparse resultant matrices for bivariate systems
- Inertia forms and resultant: A formulary
- Macaulay style formulas for sparse resultants
- On the Newton polytope of the resultant
- On the complexity of sparse elimination
- Rectangular corner cutting and Sylvester \(\mathcal{A}\)-resultants
- Residues and Resultants
- Residues in Toric Varieties
Cited in
(10)- The resultant of an unmixed bivariate system
- scientific article; zbMATH DE number 2151229 (Why is no real title available?)
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Entry formula for mixed resultant matrix of bivariate polynomial system
- Hybrid sparse resultant matrices for bivariate systems
- A matrix-based approach to properness and inversion problems for rational surfaces
- On the geometry of parametrized bicubic surfaces
- Sylvester-resultants for bivariate polynomials with planar newton polygons
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Sparse resultant of composed polynomials. I: Mixed-unmixed case.
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)