 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
◆ nf_idAdd()
Definition at line 101 of file nforder_ideal.cc.
105 coeffs C = O->basecoeffs();
109 if (
B->isFractional()) {
111 s1->skalmult(
B->viewBasisDen(), C);
116 if (
A->isFractional()) {
118 s2->skalmult(
A->viewBasisDen(), C);
131 if (
A->isFractional())
133 if (
B->isFractional())
137 if (!(modA =
A->viewMin())) {
138 modA =
A->viewNorm();
140 if (!(modB =
B->viewMin())) {
141 modB =
B->viewNorm();
150 t2 =
new bigintmat(O->getDim(), O->getDim(), C);
151 t2->
copySubmatInto(r, 1, O->getDim()+1, O->getDim(), O->getDim(), 1,1);
159 D->setBasisDenTransfer(
den);
◆ nf_idDiv()
◆ nf_idInit() [1/2]
◆ nf_idInit() [2/2]
◆ nf_idMeet()
◆ nf_idMult() [1/3]
Definition at line 285 of file nforder_ideal.cc.
294 if (
A->isFractional()) {
295 number d =
n_Copy(
A->viewBasisDen(), C);
296 s->simplifyContentDen(&d);
298 res->setBasisDenTransfer(d);
◆ nf_idMult() [2/3]
Definition at line 170 of file nforder_ideal.cc.
174 coeffs C = O->basecoeffs();
179 *rep =
new bigintmat(O->getDim(), O->getDim(), C);
180 for(
int i=0;
i<O->getDim();
i++) {
181 A->viewBasis()->getcol(
i+1, c);
197 if (!(modA =
A->viewMin())) {
198 modA =
A->viewNorm();
200 if (!(modB =
B->viewMin())) {
201 modB =
B->viewNorm();
212 t1 =
new bigintmat(O->getDim(), O->getDim(), C);
217 if (
A->isFractional()) {
218 den =
A->viewBasisDen();
220 if (
B->isFractional()) {
231 D->setBasisDenTransfer(
den);
◆ nf_idMult() [3/3]
Definition at line 241 of file nforder_ideal.cc.
248 if (
A->isFractional()) {
249 number d =
n_Copy(
A->viewBasisDen(), C);
250 s->simplifyContentDen(&d);
252 res->setBasisDenTransfer(d);
◆ nf_idPower()
bigintmat * elRepMat(bigintmat *a)
void concatcol(bigintmat *a, bigintmat *b)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
void one()
Macht Matrix (Falls quadratisch) zu Einheitsmatrix.
coeffs basecoeffs() const
bigintmat * bimMult(bigintmat *a, bigintmat *b)
number det()
det (via LaPlace in general, hnf for euc. rings)
void hnf()
transforms INPLACE to HNF
void getColRange(int j, int no, bigintmat *a)
copies the no-columns staring by j (so j...j+no-1) into the pre-allocated a
nforder_ideal * nf_idMult(nforder_ideal *A, nforder_ideal *B)
bigintmat * modhnf(number p, coeffs c)
computes HNF(this | p*I)
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
number get(int i, int j) const
get a copy of an entry. NOTE: starts at [1,1]
nforder_ideal * nf_idPower(nforder_ideal *A, int i)
void Werror(const char *fmt,...)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...
void copySubmatInto(bigintmat *, int sr, int sc, int nr, int nc, int tr, int tc)
copy the submatrix of b, staring at (a,b) having n rows, m cols into the given matrix at pos....
static FORCE_INLINE void n_Power(number a, int b, number *res, const coeffs r)
fill res with the power a^b
const CanonicalForm int s
nforder_ideal * nf_idInit(int i, coeffs O)
void simplifyContentDen(number *den)
ensures that Gcd(den, content)=1 enden hier wieder
bool skalmult(number b, coeffs c)
Multipliziert zur Matrix den Skalar b hinzu.