Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants

DOI10.1006/jsco.2001.0448zbMath0987.65044MaRDI QIDQ5937883

No author found.

Publication date: 18 July 2001

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

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

zbMATH Keywords

systems of polynomial equations; \({\mathcal A}\)-resultant; Dixon coefficient matrix; Dixon polynomials; Dixon resultant; Macaulay quotient; rectangular corner cutting

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

65H10: Numerical computation of solutions to systems of equations

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

26C10: Real polynomials: location of zeros

Related Items

0/0 simplifies implicitization, Cayley-Dixon projection operator for multi-univariate composed polynomials, Three kinds of extraneous factors in Dixon resultants, Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients, Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation, The resultant of an unmixed bivariate system, Representing rational curve segments and surface patches using semi-algebraic sets, Heuristics to sift extraneous factors in Dixon resultants, Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation, The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports

Cites Work