#include <minpoly.h>
Definition at line 68 of file minpoly.h.
◆ LinearDependencyMatrix()
LinearDependencyMatrix::LinearDependencyMatrix |
( |
unsigned |
n, |
|
|
unsigned long |
p |
|
) |
| |
Definition at line 19 of file minpoly.cc.
24 matrix =
new unsigned long *[
n];
25 for(
int i = 0;
i <
n;
i++)
27 matrix[
i] =
new unsigned long[2 *
n + 1];
30 tmprow =
new unsigned long[2 *
n + 1];
◆ ~LinearDependencyMatrix()
LinearDependencyMatrix::~LinearDependencyMatrix |
( |
| ) |
|
◆ findLinearDependency()
bool LinearDependencyMatrix::findLinearDependency |
( |
unsigned long * |
newRow, |
|
|
unsigned long * |
dep |
|
) |
| |
Definition at line 96 of file minpoly.cc.
100 for(
int i = 0;
i <
n;
i++)
115 for(
int i = 0;
i <=
n;
i++)
126 for(
int i = 0;
i < 2 *
n + 1;
i++)
void normalizeTmp(unsigned i)
int firstNonzeroEntry(unsigned long *row)
◆ firstNonzeroEntry()
int LinearDependencyMatrix::firstNonzeroEntry |
( |
unsigned long * |
row | ) |
|
◆ normalizeTmp()
void LinearDependencyMatrix::normalizeTmp |
( |
unsigned |
i | ) |
|
Definition at line 88 of file minpoly.cc.
92 for(
int j =
i + 1;
j < 2 *
n + 1;
j++)
unsigned long modularInverse(long long x, long long p)
static unsigned long multMod(unsigned long a, unsigned long b, unsigned long p)
◆ reduceTmpRow()
void LinearDependencyMatrix::reduceTmpRow |
( |
| ) |
|
◆ resetMatrix()
void LinearDependencyMatrix::resetMatrix |
( |
| ) |
|
◆ NewVectorMatrix
◆ matrix
unsigned long** LinearDependencyMatrix::matrix |
|
private |
unsigned long LinearDependencyMatrix::n |
|
private |
unsigned LinearDependencyMatrix::p |
|
private |
◆ pivots
unsigned* LinearDependencyMatrix::pivots |
|
private |
◆ rows
unsigned LinearDependencyMatrix::rows |
|
private |
◆ tmprow
unsigned long* LinearDependencyMatrix::tmprow |
|
private |
The documentation for this class was generated from the following files: