![]() |
#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 |
Functions | |
static poly | mp_Exdiv (poly m, poly d, poly vars, const ring) |
static poly | mp_Select (poly fro, poly what, const ring) |
static poly | mp_SelectId (ideal I, poly what, const ring R) |
matrix | mpNew (int r, int c) |
create a r x c zero-matrix More... | |
matrix | mp_Copy (matrix a, const ring r) |
copies matrix a (from ring r to r) More... | |
matrix | mp_Copy (const matrix a, const ring rSrc, const ring rDst) |
copies matrix a from rSrc into rDst 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) |
poly | mp_Trace (matrix a, const ring R) |
poly | TraceOfProd (matrix a, matrix b, int n, 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... | |
void | mp_Monomials (matrix c, int r, int var, matrix m, const ring R) |
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 mon, 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... | |
int | mp_Compare (matrix a, matrix b, const ring R) |
BOOLEAN | mp_Equal (matrix a, matrix b, const ring R) |
static poly | p_Insert (poly p1, poly p2, const ring R) |
static void | mp_PartClean (matrix a, int lr, int lc, const ring R) |
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) |
void | mp_Delete (matrix *a, const ring r) |
static float | mp_PolyWeight (poly p, const ring r) |
static void | mpReplace (int j, int n, int &sign, int *perm) |
static int | mp_PivBar (matrix a, int lr, int lc, const ring r) |
static void | mpSwapRow (matrix a, int pos, int lr, int lc) |
static int | mp_PrepareRow (matrix a, int lr, int lc, const ring R) |
static int | mp_PivRow (matrix a, int lr, int lc, const ring r) |
static void | mpSwapCol (matrix a, int pos, int lr, int lc) |
static int | mp_PreparePiv (matrix a, int lr, int lc, const ring r) |
static void | mp_ElimBar (matrix a0, matrix re, poly div, int lr, int lc, const ring R) |
void | mp_MinorToResult (ideal result, int &elems, matrix a, int r, int c, ideal R, const ring) |
entries of a are minors and go to result (only if not in R) More... | |
static void | mpFinalClean (matrix a) |
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 More... | |
poly | mp_DetBareiss (matrix a, const ring r) |
returns the determinant of the matrix m; uses Bareiss algorithm More... | |
matrix | mp_Wedge (matrix a, int ar, const ring R) |
static ideal | sm_MultAndShift (poly f, ideal B, int s, const ring r) |
static void | sm_AddSubMat (ideal res, ideal sm, int col, const ring r) |
ideal | sm_Tensor (ideal A, ideal 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) |
static matrix | mu (matrix A, const ring R) |
poly | mp_DetMu (matrix A, const ring R) |
DetVariant | mp_GetAlgorithmDet (matrix m, const ring r) |
DetVariant | mp_GetAlgorithmDet (const char *s) |
poly | mp_Det (matrix a, const ring r, DetVariant d) |
poly | sm_Det (ideal a, const ring r, DetVariant d) |
Definition at line 855 of file matpol.cc.
set spaces to zero by default
Definition at line 834 of file matpol.cc.
Definition at line 179 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 581 of file matpol.cc.
Definition at line 399 of file matpol.cc.
Definition at line 476 of file matpol.cc.
corresponds to Maple's coeffs: var has to be the number of a variable
Definition at line 313 of file matpol.cc.
copies matrix a from rSrc into rDst
Definition at line 85 of file matpol.cc.
Definition at line 880 of file matpol.cc.
poly mp_Det | ( | matrix | a, |
const ring | r, | ||
DetVariant | d | ||
) |
Definition at line 2143 of file matpol.cc.
returns the determinant of the matrix m; uses Bareiss algorithm
Definition at line 1676 of file matpol.cc.
Definition at line 2070 of file matpol.cc.
Definition at line 1449 of file matpol.cc.
|
static |
Definition at line 561 of file matpol.cc.
DetVariant mp_GetAlgorithmDet | ( | matrix | m, |
const ring | r | ||
) |
DetVariant mp_GetAlgorithmDet | ( | const char * | s | ) |
Definition at line 2132 of file matpol.cc.
make it a v * unit matrix
Definition at line 129 of file matpol.cc.
Definition at line 362 of file matpol.cc.
Definition at line 213 of file matpol.cc.
c = f*a
Definition at line 135 of file matpol.cc.
|
static |
Definition at line 1302 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 1603 of file matpol.cc.
|
static |
Definition at line 748 of file matpol.cc.
|
static |
Definition at line 766 of file matpol.cc.
Definition at line 196 of file matpol.cc.
Definition at line 254 of file matpol.cc.
Definition at line 1751 of file matpol.cc.
matrix mpNew | ( | int | r, |
int | c | ||
) |
|
static |
|
static |
|
static |
Definition at line 2032 of file matpol.cc.
|
static |
|
static |
poly sm_Det | ( | ideal | a, |
const ring | r, | ||
DetVariant | d | ||
) |
Definition at line 2166 of file matpol.cc.
ideal sm_Flatten | ( | ideal | a, |
const ring | R | ||
) |
Definition at line 1926 of file matpol.cc.
|
static |
Definition at line 1803 of file matpol.cc.
ideal sm_Tensor | ( | ideal | A, |
ideal | B, | ||
const ring | r | ||
) |
Definition at line 1831 of file matpol.cc.
ideal sm_UnFlatten | ( | ideal | a, |
int | col, | ||
const ring | R | ||
) |
Definition at line 1946 of file matpol.cc.