My Project
|
#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)[(long)MATCOLS((mat)) * (long)((i)-1) + (long)(j)-1] |
1-based access to matrix More... | |
#define | MATELEM0(mat, i, j) ((mat)->m)[(long)MATCOLS((mat)) * (long)(i) + (long)(j)] |
0-based access to matrix More... | |
#define | mp_New(r, c, R) mpNew(r,c) |
#define | SMATELEM(A, i, j, R) p_Vec2Poly(A->m[j],i+1,R) |
Typedefs | |
typedef ip_smatrix * | matrix |
Enumerations | |
enum | DetVariant { DetDefault =0 , DetBareiss , DetSBareiss , DetMu , DetFactory } |
Functions | |
matrix | mpNew (int r, int c) |
create a r x c zero-matrix More... | |
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, long 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_Det (matrix a, const ring r, DetVariant d=DetDefault) |
poly | mp_DetBareiss (matrix a, const ring r) |
returns the determinant of the matrix m; uses Bareiss algorithm More... | |
poly | mp_DetMu (matrix A, const ring R) |
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) |
matrix | mp_CoeffProcId (ideal I, 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 | sm_Add (ideal a, ideal b, const ring R) |
ideal | sm_Sub (ideal a, ideal b, const ring R) |
ideal | sm_Mult (ideal a, ideal b, const ring R) |
ideal | sm_Flatten (ideal a, const ring R) |
ideal | sm_UnFlatten (ideal a, int col, const ring R) |
poly | sm_Trace (ideal a, const ring R) |
int | sm_Compare (ideal a, ideal b, const ring R) |
BOOLEAN | sm_Equal (ideal a, ideal b, const ring R) |
ideal | sm_Tensor (ideal A, ideal B, const ring r) |
poly | sm_Det (ideal I, const ring, DetVariant d=DetDefault) |
DetVariant | mp_GetAlgorithmDet (matrix m, const ring r) |
DetVariant | mp_GetAlgorithmDet (const char *s) |
Variables | |
EXTERN_VAR omBin | ip_smatrix_bin |
typedef ip_smatrix* matrix |
enum DetVariant |
Enumerator | |
---|---|
DetDefault | |
DetBareiss | |
DetSBareiss | |
DetMu | |
DetFactory |
Definition at line 848 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 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 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 = DetDefault |
||
) |
Definition at line 2136 of file matpol.cc.
returns the determinant of the matrix m; uses Bareiss algorithm
Definition at line 1669 of file matpol.cc.
Definition at line 2063 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 1500 of file matpol.cc.
Definition at line 355 of file matpol.cc.
multiply a matrix 'a' by a poly 'p', destroy the args
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 1596 of file matpol.cc.
Definition at line 1744 of file matpol.cc.
matrix mpNew | ( | int | r, |
int | c | ||
) |
ideal sm_Add | ( | ideal | a, |
ideal | b, | ||
const ring | R | ||
) |
int sm_Compare | ( | ideal | a, |
ideal | b, | ||
const ring | R | ||
) |
poly sm_Det | ( | ideal | I, |
const | ring, | ||
DetVariant | d = DetDefault |
||
) |
ideal sm_Flatten | ( | ideal | a, |
const ring | R | ||
) |
Definition at line 1919 of file matpol.cc.
ideal sm_Mult | ( | ideal | a, |
ideal | b, | ||
const ring | R | ||
) |
ideal sm_Sub | ( | ideal | a, |
ideal | b, | ||
const ring | R | ||
) |
ideal sm_Tensor | ( | ideal | A, |
ideal | B, | ||
const ring | r | ||
) |
Definition at line 1824 of file matpol.cc.
poly sm_Trace | ( | ideal | a, |
const ring | R | ||
) |
ideal sm_UnFlatten | ( | ideal | a, |
int | col, | ||
const ring | R | ||
) |
Definition at line 1939 of file matpol.cc.
EXTERN_VAR omBin ip_smatrix_bin |