Constructing Sylvester-type resultant matrices using the Dixon formulation
DOI10.1016/j.jsc.2003.11.003zbMath1137.13320OpenAlexW2084988136MaRDI QIDQ2643539
Arthur D. Chtcherba, Deepak Kapur
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.11.003
supportresultantBézoutiansDixon methodBKK boundCayley-Dixon constructiondialytic matricesdialytic methodDixon resultant formulationSylvester-type matrices
Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Computational aspects and applications of commutative rings (13P99) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items
Cites Work
- Multigraded resultants of Sylvester type
- Product formulas for resultants and Chow forms
- Generalized resultants over unirational algebraic varieties
- Matrices in elimination theory
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Multihomogeneous resultant formulae by means of complexes
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Conditions for exact resultants using the Dixon formulation
- A subdivision-based algorithm for the sparse resultant
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item