![]() |
#include <polys/monomials/ring.h>Go to the source code of this file.
Data Structures | |
| class | ip_smatrix |
Macros | |
| #define | MATROWS(i) ((i)->nrows) |
| #define | MATCOLS(i) ((i)->ncols) |
| #define | MATELEM(mat, i, j) ((mat)->m)[MATCOLS((mat)) * ((i)-1) + (j)-1] |
Typedefs | |
| typedef ip_smatrix * | matrix |
Functions | |
| matrix | mpNew (int r, int c) |
| create a r x c zero-matrix More... | |
| static matrix | mp_New (int r, int c) |
| void | mp_Delete (matrix *a, const ring r) |
| matrix | mp_Copy (const matrix a, const ring rSrc, const ring rDst) |
| copies matrix a from rSrc into rDst More... | |
| matrix | mp_Copy (matrix a, const ring r) |
| copies matrix a (from ring r to r) More... | |
| matrix | mp_InitP (int r, int c, poly p, const ring R) |
| make it a p * unit matrix More... | |
| matrix | mp_InitI (int r, int c, int v, const ring R) |
| make it a v * unit matrix More... | |
| matrix | mp_MultI (matrix a, int f, const ring r) |
| c = f*a More... | |
| matrix | mp_MultP (matrix a, poly p, const ring r) |
| multiply a matrix 'a' by a poly 'p', destroy the args More... | |
| matrix | pMultMp (poly p, matrix a, const ring r) |
| matrix | mp_Add (matrix a, matrix b, const ring r) |
| matrix | mp_Sub (matrix a, matrix b, const ring r) |
| matrix | mp_Mult (matrix a, matrix b, const ring r) |
| matrix | mp_Transp (matrix a, const ring r) |
| BOOLEAN | mp_Equal (matrix a, matrix b, const ring r) |
| poly | mp_Trace (matrix a, const ring r) |
| poly | TraceOfProd (matrix a, matrix b, int n, const ring r) |
| matrix | mp_Wedge (matrix a, int ar, const ring r) |
| poly | mp_DetBareiss (matrix a, const ring r) |
| returns the determinant of the matrix m; uses Bareiss algorithm More... | |
| void | mp_Monomials (matrix c, int r, int var, matrix m, const ring R) |
| matrix | mp_Coeffs (ideal I, int var, const ring r) |
| corresponds to Maple's coeffs: var has to be the number of a variable More... | |
| matrix | mp_CoeffProc (poly f, poly vars, const ring r) |
| void | mp_Coef2 (poly v, poly vars, matrix *c, matrix *m, const ring r) |
| 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 monimials 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. More... | |
| void | mp_RecMin (int, ideal, int &, matrix, int, int, poly, ideal, const ring) |
| for minors with Bareiss More... | |
| void | mp_MinorToResult (ideal, int &, matrix, int, int, ideal, const ring) |
| entries of a are minors and go to result (only if not in R) More... | |
| BOOLEAN | mp_IsDiagUnit (matrix U, const ring r) |
| void | iiWriteMatrix (matrix im, const char *n, int dim, const ring r, int spaces) |
| set spaces to zero by default More... | |
| char * | iiStringMatrix (matrix im, int dim, const ring r, char ch=',') |
| int | mp_Compare (matrix a, matrix b, const ring r) |
| ideal | mp_Tensor (ideal A, ideal B, const ring r) |
Variables | |
| omBin | ip_smatrix_bin |
| typedef ip_smatrix* matrix |
Definition at line 764 of file matpol.cc.
Definition at line 186 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 monimials 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 512 of file matpol.cc.
Definition at line 410 of file matpol.cc.
corresponds to Maple's coeffs: var has to be the number of a variable
Definition at line 323 of file matpol.cc.
copies matrix a from rSrc into rDst
Definition at line 92 of file matpol.cc.
Definition at line 789 of file matpol.cc.
returns the determinant of the matrix m; uses Bareiss algorithm
Definition at line 1585 of file matpol.cc.
make it a v * unit matrix
Definition at line 136 of file matpol.cc.
Definition at line 373 of file matpol.cc.
Definition at line 220 of file matpol.cc.
c = f*a
Definition at line 142 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 | ||
| ) |
for minors with Bareiss
for minors with Bareiss
Definition at line 1512 of file matpol.cc.
Definition at line 203 of file matpol.cc.
| ideal mp_Tensor | ( | ideal | A, |
| ideal | B, | ||
| const ring | r | ||
| ) |
Definition at line 1757 of file matpol.cc.
Definition at line 264 of file matpol.cc.
Definition at line 1660 of file matpol.cc.
| matrix mpNew | ( | int | r, |
| int | c | ||
| ) |
| omBin ip_smatrix_bin |