Go backward to
Parallel Algebraic Geometry
Go up to
Top
Go forward to
Distributed Maple Implementation
Parallel Resultant Computation
Polynomial Resultants
Given:
A,B in
Z
[x
1
,...,x
n
]
Wanted:
C in
Z
[x
1
,...,x
n-1
]
, the resultant of
A
and
B
.
Modular Algorithm
Solve problem in multiple finite precision integer domains.
Lift result back to the domain of (arbitrary precision) integers.
Result coefficients become extremely large!
Author:
Wolfgang Schreiner
Last Modification: April 22, 1999
