Multipolynomial resultant algorithms

DOI10.1006/JSCO.1993.1009zbMath0778.13023OpenAlexW2084860168WikidataQ57425908 ScholiaQ57425908MaRDI QIDQ1260754

Dinesh Manocha, John F. Canny

Publication date: 25 August 1993

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

Full work available at URL: https://semanticscholar.org/paper/ca12baf1d1f521b83bcaac834c6dc7a26a3ec7b6

zbMATH Keywords

interpolationalgorithms for computing determinants of matricesresultants of multivariate polynomial

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Computational aspects and applications of commutative rings (13P99)

Related Items (26)

The resultant of an unmixed bivariate system ⋮ Bezout matrices, subresultant polynomials and parameters ⋮ Pseudozeros of multivariate polynomials ⋮ Parallel computation of determinants of matrices with polynomial entries ⋮ RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS ⋮ Structured matrices in the application of bivariate interpolation to curve implicitization ⋮ Resultants and contour integrals ⋮ Resultant elimination via implicit equation interpolation ⋮ Kukles revisited: Advances in computing techniques ⋮ Sparse resultant under vanishing coefficients ⋮ Dense resultant of composed polynomials: mixed-mixed case ⋮ Resultants of partially composed polynomials ⋮ A package for computations with classical resultants ⋮ A systematic framework for solving geometric constraints analytically ⋮ Computation of a specified root of a polynomial system of equations using eigenvectors ⋮ Improved algorithms for computing determinants and resultants ⋮ Exact matrix formula for the unmixed resultant in three variables ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ A proof of Hilbert's theorem on ternary quartic forms ⋮ Generalized resultants over unirational algebraic varieties ⋮ Global methods for solving systems of nonlinear algebraic equations ⋮ Fast computation of the Bézout and Dixon resultant matrices ⋮ Sparse resultant of composed polynomials. I: Mixed-unmixed case. ⋮ Sparse resultant of composed polynomials. II: Unmixed-mixed case. ⋮ Implicitization of rational surfaces by means of polynomial interpolation ⋮ A Complete Implementation for Computing General Dimensional Convex Hulls

This page was built for publication: Multipolynomial resultant algorithms