Functions | Variables
weight.cc File Reference
#include <misc/auxiliary.h>
#include <omalloc/omalloc.h>
#include <misc/options.h>
#include <misc/intvec.h>
#include <polys/monomials/ring.h>
#include <polys/monomials/p_polys.h>
#include <polys/weight.h>
#include <math.h>

Go to the source code of this file.

Functions

double wFunctionalMora (int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
 
double wFunctionalBuch (int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
 
void wAdd (int *A, int mons, int kn, int xx, int rvar)
 
void wNorm (int *degw, int *lpol, int npol, double *rel)
 
void wFirstSearch (int *A, int *x, int mons, int *lpol, int npol, double *rel, double *fopt, double wNsqr, int rvar)
 
void wSecondSearch (int *A, int *x, int *lpol, int npol, int mons, double *rel, double *fk, double wNsqr, int rvar)
 
void wGcd (int *x, int n)
 
static void wDimensions (poly *s, int sl, int *lpol, int *npol, int *mons)
 
static void wInit (poly *s, int sl, int mons, int *A, const ring R)
 
void wCall (poly *s, int sl, int *x, double wNsqr, const ring R)
 
void kEcartWeights (poly *s, int sl, short *eweight, const ring R)
 
short * iv2array (intvec *iv, const ring R)
 
long totaldegreeWecart (poly p, ring r)
 
long totaldegreeWecart_IV (poly p, ring r, const short *w)
 
long maxdegreeWecart (poly p, int *l, ring r)
 

Variables

double(* wFunctional )(int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
 

Function Documentation

◆ iv2array()

short* iv2array ( intvec iv,
const ring  R 
)

Definition at line 208 of file weight.cc.

209 {
210  short *s=(short *)omAlloc0((rVar(R)+1)*sizeof(short));
211  int len=0;
212  if(iv!=NULL)
213  len=si_min(iv->length(),rVar(R)); // usually: rVar(R)==length()
214  int i;
215  //for(i=pVariables;i>len;i--) s[i]=1;
216  for(i=len;i>0;i--) s[i]=(*iv)[i-1];
217  return s;
218 }
const CanonicalForm int s
Definition: facAbsFact.cc:55
static int si_min(const int a, const int b)
Definition: auxiliary.h:121
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
const ring R
Definition: DebugPrint.cc:36
int i
Definition: cfEzgcd.cc:123
#define NULL
Definition: omList.c:10
int length() const
Definition: intvec.h:86
#define omAlloc0(size)
Definition: omAllocDecl.h:211

◆ kEcartWeights()

void kEcartWeights ( poly s,
int  sl,
short *  eweight,
const ring  R 
)

Definition at line 190 of file weight.cc.

191 {
192  int n, i;
193  int *x;
194 
195  *eweight = 0;
196  n = rVar(R);
199  else
201  x = (int * )omAlloc(2 * (n + 1) * sizeof(int));
202  wCall(s, sl, x, (double)2.0 / (double)n, R);
203  for (i = n; i!=0; i--)
204  eweight[i] = x[i + n + 1];
205  omFreeSize((ADDRESS)x, 2 * (n + 1) * sizeof(int));
206 }
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
Definition: ring.h:751
const CanonicalForm int s
Definition: facAbsFact.cc:55
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
void * ADDRESS
Definition: auxiliary.h:115
#define omAlloc(size)
Definition: omAllocDecl.h:210
double(* wFunctional)(int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
Definition: weight.cc:28
const ring R
Definition: DebugPrint.cc:36
int i
Definition: cfEzgcd.cc:123
double wFunctionalMora(int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
Definition: weight0.c:34
void wCall(poly *s, int sl, int *x, double wNsqr, const ring R)
Definition: weight.cc:116
Variable x
Definition: cfModGcd.cc:4023
double wFunctionalBuch(int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)
Definition: weight0.c:78

◆ maxdegreeWecart()

long maxdegreeWecart ( poly  p,
int *  l,
ring  r 
)

Definition at line 255 of file weight.cc.

256 {
257  short k=p_GetComp(p, r);
258  int ll=1;
259  long t,max;
260 
261  max=totaldegreeWecart(p, r);
262  pIter(p);
263  while ((p!=NULL) && (p_GetComp(p, r)==k))
264  {
265  t=totaldegreeWecart(p, r);
266  if (t>max) max=t;
267  ll++;
268  pIter(p);
269  }
270  *l=ll;
271  return max;
272 }
long totaldegreeWecart(poly p, ring r)
Definition: weight.cc:225
return P p
Definition: myNF.cc:203
#define p_GetComp(p, r)
Definition: monomials.h:72
int k
Definition: cfEzgcd.cc:93
#define pIter(p)
Definition: monomials.h:44
const ring r
Definition: syzextra.cc:208
static int max(int a, int b)
Definition: fast_mult.cc:264
#define NULL
Definition: omList.c:10
int l
Definition: cfEzgcd.cc:94

◆ totaldegreeWecart()

long totaldegreeWecart ( poly  p,
ring  r 
)

Definition at line 225 of file weight.cc.

226 {
227  int i;
228  long j =0;
229 
230  for (i=rVar(r); i>0; i--)
231  j += (int)(p_GetExp(p,i,r) * ecartWeights[i]);
232  return j;
233 }
return P p
Definition: myNF.cc:203
short * ecartWeights
Definition: weight0.c:28
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
const ring r
Definition: syzextra.cc:208
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:464
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123

◆ totaldegreeWecart_IV()

long totaldegreeWecart_IV ( poly  p,
ring  r,
const short *  w 
)

Definition at line 239 of file weight.cc.

240 {
241  int i;
242  long j =0;
243 
244  for (i=rVar(r); i>0; i--)
245  j += (long)((int)(p_GetExp(p,i,r) * w[i]));
246  return j;
247 }
return P p
Definition: myNF.cc:203
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
const ring r
Definition: syzextra.cc:208
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
Definition: p_polys.h:464
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123
const CanonicalForm & w
Definition: facAbsFact.cc:55

◆ wAdd()

void wAdd ( int *  A,
int  mons,
int  kn,
int  xx,
int  rvar 
)

Definition at line 132 of file weight0.c.

133 {
134  int i, *B, *ex;
135 
136  B = A + ((kn - 1) * mons);
137  ex = A + (rvar * mons);
138  i = mons;
139  if (xx == 1)
140  {
141  for (/* i=mons */; i!=0 ; i--)
142  *ex++ += *B++;
143  }
144  else
145  {
146  for (/* i=mons */; i!=0 ; i--)
147  *ex++ += (*B++) * xx;
148  }
149 }
#define A
Definition: sirandom.c:23
int i
Definition: cfEzgcd.cc:123
b *CanonicalForm B
Definition: facBivar.cc:51

◆ wCall()

void wCall ( poly s,
int  sl,
int *  x,
double  wNsqr,
const ring  R 
)

Definition at line 116 of file weight.cc.

117 {
118  int n, q, npol, mons, i;
119  int *A, *xopt, *lpol, *degw;
120  double f1, fx, eps, *rel;
121  void *adr;
122 
123  n = rVar(R);
124  lpol = (int * )omAlloc((sl + 1) * sizeof(int));
125  wDimensions(s, sl, lpol, &npol, &mons);
126  xopt = x + (n + 1);
127  for (i = n; i!=0; i--)
128  xopt[i] = 1;
129  if (mons==0)
130  {
131  omFreeSize((ADDRESS)lpol, (sl + 1) * sizeof(int));
132  return;
133  }
134  adr = (void * )omAllocAligned(npol * sizeof(double));
135  rel = (double*)adr;
136  q = (n + 1) * mons * sizeof(int);
137  A = (int * )omAlloc(q);
138  wInit(s, sl, mons, A, R);
139  degw = A + (n * mons);
140  memset(degw, 0, mons * sizeof(int));
141  for (i = n; i!=0; i--)
142  wAdd(A, mons, i, 1, rVar(R));
143  wNorm(degw, lpol, npol, rel);
144  f1 = (*wFunctional)(degw, lpol, npol, rel, (double)1.0, wNsqr);
145  if (TEST_OPT_PROT) Print("// %e\n",f1);
146  eps = f1;
147  fx = (double)2.0 * eps;
148  memset(x, 0, (n + 1) * sizeof(int));
149  wFirstSearch(A, x, mons, lpol, npol, rel, &fx, wNsqr, rVar(R));
150  if (TEST_OPT_PROT) Print("// %e\n",fx);
151  memcpy(x + 1, xopt + 1, n * sizeof(int));
152  memset(degw, 0, mons * sizeof(int));
153  for (i = n; i!=0; i--)
154  {
155  x[i] *= 16;
156  wAdd(A, mons, i, x[i], rVar(R));
157  }
158  wSecondSearch(A, x, lpol, npol, mons, rel, &fx, wNsqr, rVar(R));
159  if (TEST_OPT_PROT) Print("// %e\n",fx);
160  if (fx >= eps)
161  {
162  for (i = n; i!=0; i--)
163  xopt[i] = 1;
164  }
165  else
166  {
167  wGcd(xopt, n);
168 // if (BTEST1(22))
169 // {
170 // f1 = fx + (double)0.1 * (f1 - fx);
171 // wSimple(x, n);
172 // memset(degw, 0, mons * sizeof(int));
173 // for (i = n; i!=0; i--)
174 // wAdd(A, mons, i, x[i], rVar(R));
175 // eps = wPrWeight(x, n);
176 // fx = (*wFunctional)(degw, lpol, npol, rel, eps);
177 // if (fx < f1)
178 // {
179 // if (TEST_OPT_PROT) Print("// %e\n",fx);
180 // memcpy(xopt + 1, x + 1, n * sizeof(int));
181 // }
182 // }
183  }
184  omFreeSize((ADDRESS)A, q);
185  omFreeSize((ADDRESS)lpol, (sl + 1) * sizeof(int));
186  omFreeSize((ADDRESS)adr, npol * sizeof(double));
187 }
const CanonicalForm int s
Definition: facAbsFact.cc:55
#define Print
Definition: emacs.cc:83
#define TEST_OPT_PROT
Definition: options.h:98
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define omAllocAligned
Definition: omAllocDecl.h:273
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
void wAdd(int *A, int mons, int kn, int xx, int rvar)
Definition: weight0.c:132
void * ADDRESS
Definition: auxiliary.h:115
#define omAlloc(size)
Definition: omAllocDecl.h:210
void wSecondSearch(int *A, int *x, int *lpol, int npol, int mons, double *rel, double *fk, double wNsqr, int rvar)
Definition: weight0.c:295
#define A
Definition: sirandom.c:23
const ring R
Definition: DebugPrint.cc:36
int i
Definition: cfEzgcd.cc:123
static void wDimensions(poly *s, int sl, int *lpol, int *npol, int *mons)
Definition: weight.cc:42
static void wInit(poly *s, int sl, int mons, int *A, const ring R)
Definition: weight.cc:72
Variable x
Definition: cfModGcd.cc:4023
void wFirstSearch(int *A, int *x, int mons, int *lpol, int npol, double *rel, double *fopt, double wNsqr, int rvar)
Definition: weight0.c:152
void wNorm(int *degw, int *lpol, int npol, double *rel)
Definition: weight0.c:463
void wGcd(int *x, int n)
Definition: weight0.c:352

◆ wDimensions()

static void wDimensions ( poly s,
int  sl,
int *  lpol,
int *  npol,
int *  mons 
)
static

Definition at line 42 of file weight.cc.

43 {
44  int i, i1, j, k;
45  poly p, q;
46 
47  i1 = j = 0;
48  for (i = 0; i <= sl; i++)
49  {
50  p = s[i];
51  if (p!=NULL)
52  {
53  k = 1;
54  q = pNext(p);
55  while (q!=NULL)
56  {
57  k++;
58  q = pNext(q);
59  }
60  if (k > 1)
61  {
62  lpol[i1++] = k;
63  j += k;
64  }
65  }
66  }
67  *npol = i1;
68  *mons = j;
69 }
const CanonicalForm int s
Definition: facAbsFact.cc:55
return P p
Definition: myNF.cc:203
int k
Definition: cfEzgcd.cc:93
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123
#define NULL
Definition: omList.c:10
#define pNext(p)
Definition: monomials.h:43
polyrec * poly
Definition: hilb.h:10

◆ wFirstSearch()

void wFirstSearch ( int *  A,
int *  x,
int  mons,
int *  lpol,
int  npol,
double *  rel,
double *  fopt,
double  wNsqr,
int  rvar 
)

Definition at line 152 of file weight0.c.

154 {
155  int a0, a, n, xn, t, xx, y1;
156  int *y, *degw, *xopt;
157  double fy, fmax, wx;
158  double *pr;
159  void *adr;
160 
161  fy = *fopt;
162  n = rvar;
163  xn = n + 6 + (21 / n);
164  a0 = n * sizeof(double);
165  a = n * sizeof(int);
166  y = (int * )omAlloc((long)a);
167  adr = (void * )omAllocAligned((long)a0);
168  pr = adr;
169  *pr = (double)1.0;
170  *y = 0;
171  degw = A + (n * mons);
172  xopt = x + (n + 2);
173  t = 1;
174  loop
175  {
176  while (t < n)
177  {
178  xx = x[t] + 1;
179  wx = pr[t-1] * (double)xx;
180  y1 = y[t-1] + xx;
181  if ((y1 + n - t) <= xn)
182  {
183  pr[t] = wx;
184  y[t] = y1;
185  x[t] = xx;
186  if (xx > 1)
187  wAdd(A, mons, t, 1, rvar);
188  t++;
189  }
190  else
191  {
192  xx = x[t] - 1;
193  x[t] = 0;
194  if (xx!=0)
195  wSub(A, mons, t, xx, rvar);
196  t--;
197  if (t==0)
198  {
199  *fopt = fy;
200  omFreeSize((ADDRESS)y, (long)a);
201  omFreeSize((ADDRESS)adr, (long)a0);
202  return;
203  }
204  }
205  }
206  xx = xn - y[t-1];
207  wx = pr[t-1] * (double)xx;
208  x[t] = xx;
209  xx--;
210  if (xx!=0)
211  wAdd(A, mons, t, xx, rvar);
212  fmax = (*wFunctional)(degw, lpol, npol, rel, wx,wNsqr);
213  if (xx!=0)
214  wSub(A, mons, t, xx, rvar);
215  if (fmax < fy)
216  {
217  fy = fmax;
218  memcpy(xopt, x + 1, a);
219  }
220  t--;
221  } /* end loop */
222 }
const CanonicalForm int const CFList const Variable & y
Definition: facAbsFact.cc:57
const poly a
Definition: syzextra.cc:212
loop
Definition: myNF.cc:98
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define omAllocAligned
Definition: omAllocDecl.h:273
void * ADDRESS
Definition: auxiliary.h:115
#define omAlloc(size)
Definition: omAllocDecl.h:210
int xn
Definition: walk.cc:4517
static void wSub(int *A, int mons, int kn, int xx, int rvar)
Definition: weight0.c:112
#define A
Definition: sirandom.c:23
void wAdd(int *A, int mons, int kn, int xx, int rvar)
Definition: weight0.c:132
Variable x
Definition: cfModGcd.cc:4023

◆ wFunctionalBuch()

double wFunctionalBuch ( int *  degw,
int *  lpol,
int  npol,
double *  rel,
double  wx,
double  wNsqr 
)

Definition at line 78 of file weight0.c.

80 {
81  int i, j, ecl, ecu, ec;
82  int *ex;
83  double gfmax, ghom, pfmax;
84  double *r;
85 
86  ex = degw;
87  r = rel;
88  gfmax = (double)0.0;
89  ghom = (double)1.0;
90  for (i = 0; i < npol; i++)
91  {
92  ecu = ecl = *ex++;
93  for (j = lpol[i] - 1; j!=0 ; j--)
94  {
95  ec = *ex++;
96  if (ec < ecl)
97  ecl = ec;
98  else if (ec > ecu)
99  ecu = ec;
100  }
101  pfmax = (double)ecl / (double)ecu;
102  if (pfmax < ghom)
103  ghom = pfmax;
104  gfmax += (double)(ecu * ecu) * (*r++);
105  }
106  if (ghom > (double)0.5)
107  gfmax *= ((double)1.0 - (ghom * ghom)) / (double)0.75;
108  return gfmax / pow(wx, wNsqr);
109 }
const ring r
Definition: syzextra.cc:208
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123
Rational pow(const Rational &a, int e)
Definition: GMPrat.cc:418

◆ wFunctionalMora()

double wFunctionalMora ( int *  degw,
int *  lpol,
int  npol,
double *  rel,
double  wx,
double  wNsqr 
)

Definition at line 34 of file weight0.c.

36 {
37  int i, j, e1, ecu, ecl, ec;
38  int *ex;
39  double gfmax, gecart, ghom, pfmax;
40  double *r;
41 
42  ex = degw;
43  r = rel;
44  gfmax = (double)0.0;
45  gecart = (double)0.4 + (double)npol;
46  ghom = (double)1.0;
47  for (i = 0; i < npol; i++)
48  {
49  ecl = ecu = e1 = *ex++;
50  for (j = lpol[i] - 1; j!=0; j--)
51  {
52  ec = *ex++;
53  if (ec > ecu)
54  ecu = ec;
55  else if (ec < ecl)
56  ecl = ec;
57  }
58  pfmax = (double)ecl / (double)ecu;
59  if (pfmax < ghom)
60  ghom = pfmax;
61  pfmax = (double)e1 / (double)ecu;
62  if (pfmax > (double)0.5)
63  gecart -= (pfmax * pfmax);
64  else
65  gecart -= (double)0.25;
66  ecu = 2 * ecu - ecl;
67  gfmax += (double)(ecu * ecu) * (*r++);
68  }
69  if (ghom > (double)0.8)
70  {
71  ghom *= (double)5.0;
72  gecart *= ((double)5.0 - ghom);
73  }
74  return (gfmax * gecart) / pow(wx, wNsqr);
75 }
const ring r
Definition: syzextra.cc:208
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123
Rational pow(const Rational &a, int e)
Definition: GMPrat.cc:418

◆ wGcd()

void wGcd ( int *  x,
int  n 
)

Definition at line 352 of file weight0.c.

353 {
354  int i, b, a, h;
355 
356  i = n;
357  b = x[i];
358  loop
359  {
360  i--;
361  if (i==0)
362  break;
363  a = x[i];
364  if (a < b)
365  {
366  h = a;
367  a = b;
368  b = h;
369  }
370  do
371  {
372  h = a % b;
373  a = b;
374  b = h;
375  }
376  while (b!=0);
377  b = a;
378  if (b == 1)
379  return;
380  }
381  for (i = n; i!=0 ; i--)
382  x[i] /= b;
383 }
const poly a
Definition: syzextra.cc:212
loop
Definition: myNF.cc:98
int i
Definition: cfEzgcd.cc:123
Variable x
Definition: cfModGcd.cc:4023
static Poly * h
Definition: janet.cc:978
const poly b
Definition: syzextra.cc:213

◆ wInit()

static void wInit ( poly s,
int  sl,
int  mons,
int *  A,
const ring  R 
)
static

Definition at line 72 of file weight.cc.

73 {
74  int n, a, i, j, *B, *C;
75  poly p, q;
76  int *pl;
77 
78  B = A;
79  n = rVar(R);
80  a = (n + 1) * sizeof(int);
81  pl = (int *)omAlloc(a);
82  for (i = 0; i <= sl; i++)
83  {
84  p = s[i];
85  if (p!=NULL)
86  {
87  q = pNext(p);
88  if (q!=NULL)
89  {
90  C = B;
91  B++;
92  p_GetExpV(p, pl,R);
93  for (j = 0; j < n; j++)
94  {
95  *C = pl[j+1];
96  C += mons;
97  }
98  }
99  while (q!=NULL)
100  {
101  C = B;
102  B++;
103  p_GetExpV(q, pl,R);
104  for (j = 0; j < n; j++)
105  {
106  *C = pl[j+1];
107  C += mons;
108  }
109  pIter(q);
110  }
111  }
112  }
113  omFreeSize((ADDRESS)pl, a);
114 }
const CanonicalForm int s
Definition: facAbsFact.cc:55
const poly a
Definition: syzextra.cc:212
return P p
Definition: myNF.cc:203
static void p_GetExpV(poly p, int *ev, const ring r)
Definition: p_polys.h:1443
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
static short rVar(const ring r)
#define rVar(r) (r->N)
Definition: ring.h:583
void * ADDRESS
Definition: auxiliary.h:115
#define omAlloc(size)
Definition: omAllocDecl.h:210
#define pIter(p)
Definition: monomials.h:44
int j
Definition: myNF.cc:70
#define A
Definition: sirandom.c:23
const ring R
Definition: DebugPrint.cc:36
int i
Definition: cfEzgcd.cc:123
#define NULL
Definition: omList.c:10
b *CanonicalForm B
Definition: facBivar.cc:51
#define pNext(p)
Definition: monomials.h:43
polyrec * poly
Definition: hilb.h:10

◆ wNorm()

void wNorm ( int *  degw,
int *  lpol,
int  npol,
double *  rel 
)

Definition at line 463 of file weight0.c.

464 {
465  int i, j, ecu, ec;
466  int *ex;
467  double *r;
468 
469  ex = degw;
470  r = rel;
471  for (i = 0; i < npol; i++)
472  {
473  ecu = *ex++;
474  for (j = lpol[i] - 1; j!=0 ; j--)
475  {
476  ec = *ex++;
477  if (ec > ecu)
478  ecu = ec;
479  }
480  *r = (double)1.0 / (double)(ecu * ecu);
481  r++;
482  }
483 }
const ring r
Definition: syzextra.cc:208
int j
Definition: myNF.cc:70
int i
Definition: cfEzgcd.cc:123

◆ wSecondSearch()

void wSecondSearch ( int *  A,
int *  x,
int *  lpol,
int  npol,
int  mons,
double *  rel,
double *  fk,
double  wNsqr,
int  rvar 
)

Definition at line 295 of file weight0.c.

297 {
298  int n, s0, s1, s2, *xopt;
299  double fx, fopt, wx;
300 
301  n = rvar;
302  xopt = x + (n + 2);
303  fopt = *fk * (double)0.999999999999;
304  wx = wPrWeight(x, n);
305  loop
306  {
307  wEstimate(A, x, lpol, npol, mons, wx, rel, &fx, &s0, &s1, &s2, wNsqr, rvar);
308  if (fx > fopt)
309  {
310  if (s0!=0)
311  x[s0]--;
312  else if (s1!=0)
313  {
314  x[s1]--;
315  x[s2]--;
316  }
317  else
318  break;
319  }
320  else
321  {
322  fopt = fx;
323  if (s0!=0)
324  {
325  x[s0]--;
326  memcpy(xopt, x + 1, n * sizeof(int));
327  if (s1==0)
328  break;
329  }
330  else if (s1!=0)
331  {
332  x[s1]--;
333  x[s2]--;
334  memcpy(xopt, x + 1, n * sizeof(int));
335  }
336  else
337  break;
338  }
339  if (s0!=0)
340  wSub(A, mons, s0, 1, rvar);
341  else
342  {
343  wSub(A, mons, s1, 1, rvar);
344  wSub(A, mons, s2, 1, rvar);
345  }
346  wx = wPrWeight(x, n);
347  }
348  *fk = fopt;
349 }
static double wPrWeight(int *x, int n)
Definition: weight0.c:225
loop
Definition: myNF.cc:98
static void wSub(int *A, int mons, int kn, int xx, int rvar)
Definition: weight0.c:112
#define A
Definition: sirandom.c:23
static void wEstimate(int *A, int *x, int *lpol, int npol, int mons, double wx, double *rel, double *fopt, int *s0, int *s1, int *s2, double wNsqr, int rvar)
Definition: weight0.c:237
Variable x
Definition: cfModGcd.cc:4023

Variable Documentation

◆ wFunctional

double(* wFunctional) (int *degw, int *lpol, int npol, double *rel, double wx, double wNsqr)

Definition at line 28 of file weight.cc.