![]() |
My Project
|
#include "misc/auxiliary.h"
#include "misc/mylimits.h"
#include "misc/intvec.h"
#include "coeffs/numbers.h"
#include "reporter/reporter.h"
#include "monomials/ring.h"
#include "monomials/p_polys.h"
#include "simpleideals.h"
#include "matpol.h"
#include "prCopy.h"
#include "clapsing.h"
#include "sparsmat.h"
Go to the source code of this file.
Data Structures | |
class | row_col_weight |
class | mp_permmatrix |
Definition at line 849 of file matpol.cc.
Definition at line 172 of file matpol.cc.
corresponds to Macauley's coef: the exponent vector of vars has to contain the variables, eg 'xy'; then the poly f is searched for monomials in x and y, these monomials are written to the first row of the matrix co. the second row of co contains the respective factors in f. Thus f = sum co[1,i]*co[2,i], i = 1..cols, rows equals 2.
Definition at line 574 of file matpol.cc.
Definition at line 392 of file matpol.cc.
Definition at line 469 of file matpol.cc.
corresponds to Maple's coeffs: var has to be the number of a variable
Definition at line 306 of file matpol.cc.
copies matrix a (from ring r to r)
poly mp_Det | ( | matrix | a, |
const ring | r, | ||
DetVariant | d | ||
) |
Definition at line 2139 of file matpol.cc.
returns the determinant of the matrix m; uses Bareiss algorithm
Definition at line 1670 of file matpol.cc.
Definition at line 2066 of file matpol.cc.
DetVariant mp_GetAlgorithmDet | ( | const char * | s | ) |
DetVariant mp_GetAlgorithmDet | ( | matrix | m, |
const ring | r | ||
) |
make it a v * unit matrix
Definition at line 122 of file matpol.cc.
make it a p * unit matrix
entries of a are minors and go to result (only if not in R)
Definition at line 1501 of file matpol.cc.
Definition at line 355 of file matpol.cc.
multiply a matrix 'a' by a poly 'p', destroy the args
Definition at line 1296 of file matpol.cc.
void mp_RecMin | ( | int | ar, |
ideal | result, | ||
int & | elems, | ||
matrix | a, | ||
int | lr, | ||
int | lc, | ||
poly | barDiv, | ||
ideal | R, | ||
const ring | r | ||
) |
produces recursively the ideal of all arxar-minors of a
for minors with Bareiss
Definition at line 1597 of file matpol.cc.
Definition at line 1745 of file matpol.cc.
Definition at line 2028 of file matpol.cc.
Definition at line 684 of file matpol.cc.
poly sm_Det | ( | ideal | a, |
const ring | r, | ||
DetVariant | d | ||
) |
Definition at line 1922 of file matpol.cc.
Definition at line 1827 of file matpol.cc.
Definition at line 1942 of file matpol.cc.