My Project
|
#include "kernel/mod2.h"
#include "kernel/linear_algebra/MinorInterface.h"
#include "kernel/linear_algebra/MinorProcessor.h"
#include "polys/simpleideals.h"
#include "coeffs/modulop.h"
#include "kernel/polys.h"
#include "kernel/structs.h"
#include "kernel/GBEngine/kstd1.h"
#include "kernel/ideals.h"
Go to the source code of this file.
Functions | |
bool | arrayIsNumberArray (const poly *polyArray, const ideal iSB, const int length, int *intArray, poly *nfPolyArray, int &zeroCounter) |
ideal | getMinorIdeal_Int (const int *intMatrix, const int rowCount, const int columnCount, const int minorSize, const int k, const char *algorithm, const ideal i, const bool allDifferent) |
ideal | getMinorIdeal_Poly (const poly *polyMatrix, const int rowCount, const int columnCount, const int minorSize, const int k, const char *algorithm, const ideal i, const bool allDifferent) |
ideal | getMinorIdeal_toBeDone (const matrix mat, const int minorSize, const int k, const char *algorithm, const ideal i, const bool allDifferent) |
ideal | getMinorIdeal (const matrix mat, const int minorSize, const int k, const char *algorithm, const ideal iSB, const bool allDifferent) |
Returns the specified set of minors (= subdeterminantes) of the given matrix. More... | |
ideal | getMinorIdealCache_Int (const int *intMatrix, const int rowCount, const int columnCount, const int minorSize, const int k, const ideal i, const int cacheStrategy, const int cacheN, const int cacheW, const bool allDifferent) |
ideal | getMinorIdealCache_Poly (const poly *polyMatrix, const int rowCount, const int columnCount, const int minorSize, const int k, const ideal i, const int cacheStrategy, const int cacheN, const int cacheW, const bool allDifferent) |
ideal | getMinorIdealCache_toBeDone (const matrix mat, const int minorSize, const int k, const ideal iSB, const int cacheStrategy, const int cacheN, const int cacheW, const bool allDifferent) |
ideal | getMinorIdealCache (const matrix mat, const int minorSize, const int k, const ideal iSB, const int cacheStrategy, const int cacheN, const int cacheW, const bool allDifferent) |
Returns the specified set of minors (= subdeterminantes) of the given matrix. More... | |
ideal | getMinorIdealHeuristic (const matrix mat, const int minorSize, const int k, const ideal iSB, const bool allDifferent) |
Returns the specified set of minors (= subdeterminantes) of the given matrix. More... | |
bool arrayIsNumberArray | ( | const poly * | polyArray, |
const ideal | iSB, | ||
const int | length, | ||
int * | intArray, | ||
poly * | nfPolyArray, | ||
int & | zeroCounter | ||
) |
Definition at line 29 of file MinorInterface.cc.
ideal getMinorIdeal | ( | const matrix | m, |
const int | minorSize, | ||
const int | k, | ||
const char * | algorithm, | ||
const ideal | i, | ||
const bool | allDifferent | ||
) |
Returns the specified set of minors (= subdeterminantes) of the given matrix.
These minors form the set of generators of the ideal which is actually returned.
If k == 0, all non-zero minors will be computed. For k > 0, only the first k non-zero minors (to some fixed ordering among all minors) will be computed. Use k < 0 to compute the first |k| minors (including zero minors).
algorithm must be one of "Bareiss" and "Laplace".
i must be either NULL or an ideal capturing a standard basis. In the later case all minors will be reduced w.r.t. i. If allDifferent is true, each minor will be included as generator in the resulting ideal only once; otherwise as often as it occurs as minor value during the computation.
m | the matrix from which to compute minors |
minorSize | the size of the minors to be computed |
k | the number of minors to be computed |
algorithm | the algorithm to be used for the computation |
i | NULL or an ideal which encodes a standard basis |
allDifferent | if true each minor is considered only once |
Definition at line 238 of file MinorInterface.cc.
ideal getMinorIdeal_Int | ( | const int * | intMatrix, |
const int | rowCount, | ||
const int | columnCount, | ||
const int | minorSize, | ||
const int | k, | ||
const char * | algorithm, | ||
const ideal | i, | ||
const bool | allDifferent | ||
) |
Definition at line 74 of file MinorInterface.cc.
ideal getMinorIdeal_Poly | ( | const poly * | polyMatrix, |
const int | rowCount, | ||
const int | columnCount, | ||
const int | minorSize, | ||
const int | k, | ||
const char * | algorithm, | ||
const ideal | i, | ||
const bool | allDifferent | ||
) |
Definition at line 129 of file MinorInterface.cc.
ideal getMinorIdeal_toBeDone | ( | const matrix | mat, |
const int | minorSize, | ||
const int | k, | ||
const char * | algorithm, | ||
const ideal | i, | ||
const bool | allDifferent | ||
) |
Definition at line 187 of file MinorInterface.cc.
ideal getMinorIdealCache | ( | const matrix | m, |
const int | minorSize, | ||
const int | k, | ||
const ideal | i, | ||
const int | cacheStrategy, | ||
const int | cacheN, | ||
const int | cacheW, | ||
const bool | allDifferent | ||
) |
Returns the specified set of minors (= subdeterminantes) of the given matrix.
These minors form the set of generators of the ideal which is actually returned.
If k == 0, all non-zero minors will be computed. For k > 0, only the first k non-zero minors (to some fixed ordering among all minors) will be computed. Use k < 0 to compute the first |k| minors (including zero minors).
The underlying algorithm is Laplace's algorithm with caching of certain subdeterminantes. The caching strategy can be set; see int MinorValue::getUtility () const in Minor.cc. cacheN is the maximum number of cached polynomials (=subdeterminantes); cacheW the maximum weight of the cache during all computations.
i must be either NULL or an ideal capturing a standard basis. In the later case all minors will be reduced w.r.t. i. If allDifferent is true, each minor will be included as generator in the resulting ideal only once; otherwise as often as it occurs as minor value during the computation.
m | the matrix from which to compute minors |
minorSize | the size of the minors to be computed |
k | the number of minors to be computed |
i | NULL or an ideal which encodes a standard basis |
cacheStrategy | one of {1, .., 5}; see Minor.cc |
cacheN | maximum number of cached polynomials (=subdeterminantes) |
cacheW | maximum weight of the cache |
allDifferent | if true each minor is considered only once |
Definition at line 457 of file MinorInterface.cc.
ideal getMinorIdealCache_Int | ( | const int * | intMatrix, |
const int | rowCount, | ||
const int | columnCount, | ||
const int | minorSize, | ||
const int | k, | ||
const ideal | i, | ||
const int | cacheStrategy, | ||
const int | cacheN, | ||
const int | cacheW, | ||
const bool | allDifferent | ||
) |
Definition at line 302 of file MinorInterface.cc.
ideal getMinorIdealCache_Poly | ( | const poly * | polyMatrix, |
const int | rowCount, | ||
const int | columnCount, | ||
const int | minorSize, | ||
const int | k, | ||
const ideal | i, | ||
const int | cacheStrategy, | ||
const int | cacheN, | ||
const int | cacheW, | ||
const bool | allDifferent | ||
) |
Definition at line 360 of file MinorInterface.cc.
ideal getMinorIdealCache_toBeDone | ( | const matrix | mat, |
const int | minorSize, | ||
const int | k, | ||
const ideal | iSB, | ||
const int | cacheStrategy, | ||
const int | cacheN, | ||
const int | cacheW, | ||
const bool | allDifferent | ||
) |
Definition at line 424 of file MinorInterface.cc.
ideal getMinorIdealHeuristic | ( | const matrix | m, |
const int | minorSize, | ||
const int | k, | ||
const ideal | i, | ||
const bool | allDifferent | ||
) |
Returns the specified set of minors (= subdeterminantes) of the given matrix.
These minors form the set of generators of the ideal which is actually returned.
If k == 0, all non-zero minors will be computed. For k > 0, only the first k non-zero minors (to some fixed ordering among all minors) will be computed. Use k < 0 to compute the first |k| minors (including zero minors).
The algorithm is heuristically chosen among "Bareiss", "Laplace", and Laplace with caching (of subdeterminants).
i must be either NULL or an ideal capturing a standard basis. In the later case all minors will be reduced w.r.t. i. If allDifferent is true, each minor will be included as generator in the resulting ideal only once; otherwise as often as it occurs as minor value during the computation.
m | the matrix from which to compute minors |
minorSize | the size of the minors to be computed |
k | the number of minors to be computed |
i | NULL or an ideal which encodes a standard basis |
allDifferent | if true each minor is considered only once |
Definition at line 495 of file MinorInterface.cc.