Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
From MaRDI portal
Publication:1878474
DOI10.1016/S0747-7171(03)00084-1zbMath1108.13313OpenAlexW2078805441MaRDI QIDQ1878474
Arthur D. Chtcherba, Deepak Kapur
Publication date: 20 August 2004
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(03)00084-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Complexity of constructing Dixon resultant matrix ⋮ Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation ⋮ Resultant elimination via implicit equation interpolation ⋮ Index reduction of differential algebraic equations by differential Dixon resultant ⋮ Cayley-Dixon projection operator for multi-univariate composed polynomials ⋮ Three kinds of extraneous factors in Dixon resultants ⋮ Heuristics to sift extraneous factors in Dixon resultants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Chow polytopes and general resultants
- Multigraded resultants of Sylvester type
- Matrices in elimination theory
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Conditions for exact resultants using the Dixon formulation
- Rectangular corner cutting and Sylvester A-resultants
- A subdivision-based algorithm for the sparse resultant
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
This page was built for publication: Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
