Back to Search Start Over

A Subdivision-Based Algorithm for the Sparse Resultant.

Authors :
Canny, John F.
Emiris, Ioannis Z.
Source :
Journal of the ACM; May2000, Vol. 47 Issue 3, p417, 44p, 6 Diagrams
Publication Year :
2000

Abstract

Proposes a determinantal formula for the sparse resultant of an arbitrary system of n+1 polynomials in n variables. Use of a mixed polyhedral subdivision of Minkowski sum of the Newton polytopes to construct a Newton matrix; How to compute the sparse resultant for arbitrary specialization; Analysis of the worst-case asymptotic bit complexity.

Subjects

Subjects :
ELIMINATION (Mathematics)
NEWTON diagrams
ALGORITHMS
POLYNOMIALS
POLYHEDRAL functions
MATHEMATICAL models

Details

Language :
English
ISSN :
00045411
Volume :
47
Issue :
3
Database :
Complementary Index
Journal :
Journal of the ACM
Publication Type :
Academic Journal
Accession number :
3690718
Full Text :
https://doi.org/10.1145/337244.337247
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details