|
D.8.2.4 mp_res_mat
Procedure from library solve.lib (see solve_lib).
- Usage:
- mp_res_mat(i [, k] ); i ideal, k integer,
k=0: sparse resultant matrix of Gelfand, Kapranov and Zelevinsky,
k=1: resultant matrix of Macaulay (k=0 is default)
- Assume:
- The number of elements in the input system must be the number of
variables in the basering plus one;
if k=1 then i must be homogeneous.
- Return:
- module representing the multipolynomial resultant matrix
Example:
|