The Calculation of Multivariate Polynomial Resultants

DOI10.1145/321662.321666zbMath0226.65042OpenAlexW2040904008MaRDI QIDQ5633585

George E. Collins

Publication date: 1971

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321662.321666

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Black-box polynomial resultants, Primitive polynomial remainder sequences in elimination theory, Decomposition of algebraic sets and applications to weak centers of cubic systems, An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space, Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves, Finding all real zeros of polynomial systems using multi-resultant, Generation of configuration space obstacles: The case of moving algebraic curves, Counting types of rigid frameworks, The efficient calculation of powers of polynomials, Distributed Maple: Parallel computer algebra in networked environments., Subresultants revisited., Fast norm computation in smooth-degree abelian number fields, Fourth Order Difference Methods for the Initial Boundary-Value Problem for Hyperbolic Equations, Computing primitive elements of extension fields, On computing the intersection of a pair of algebraic surfaces, QR-algebraic method for approximating zeros of system of polynomials, Design of Imaginary Spectrum of LTI Systems with Delays to Manipulate Stability Regions, Hopf Cyclicity and Global Dynamics for a Predator–Prey System of Leslie Type with Simplified Holling Type IV Functional Response, Distances from differences of roots of polynomials to the nearest integers, Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r\)], A fast method for interpolation using preconditioning, Detecting algebraic curves in bad position, Fast modular transforms, Computational aspects of deciding if all roots of a polynomial lie within the unit circle, The resultants method for approximating real fixed points of polynomials, Four limit cycles in a predator-prey system of Leslie type with generalized Holling type III functional response, On the security properties of Russian standardized elliptic curves, Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams, Two-dimensional Hankel theory, A Petrov‐Galerkin method and boundary approximations for hyperbolic initial boundary‐value problems, Characterization of equilibrium sets for bilinear systems with feedback control, Zur Charakterisierung und Berechnung von symmetrischen Kubaturformeln, Fields of algebraic numbers computable in polynomial time. I, Congruence arithmetic algorithms for polynomial real zero determination, Convex hulls of objects bounded by algebraic curves, On relations between Jacobians and resultants of polynomials in two variables, Local box adjacency algorithms for cylindrical algebraic decompositions, The Minimum Root Separation of a Polynomial, Linear recurring sequences for computing the resultant of multivariate polynomials