Révision 228 pobysoPythonSage/src/sageSLZ/sageRunSLZ.sage
| sageRunSLZ.sage (revision 228) | ||
|---|---|---|
| 3127 | 3127 |
slz_interval_and_polynomial_to_sage((prceSo[0], prceSo[0], |
| 3128 | 3128 |
prceSo[1], prceSo[2], |
| 3129 | 3129 |
prceSo[3])) |
| 3130 |
print "Sage Taylor polynomial:", floatP, floatP.parent() |
|
| 3131 |
floatPcoeffs = floatP.coefficients() |
|
| 3132 |
for coeff in floatPcoeffs: |
|
| 3133 |
print coeff.n(prec=coeff.parent().prec()).str(base=2) |
|
| 3134 |
print coeff.n(prec=coeff.parent().prec()) |
|
| 3130 | 3135 |
intvl = RRIF(intvl) |
| 3131 | 3136 |
## Clean-up Sollya stuff. |
| 3132 | 3137 |
for elem in prceSo: |
| ... | ... | |
| 3218 | 3223 |
print "Least common multiple:", leastCommonMultiple |
| 3219 | 3224 |
basisConstructionsFullTime += cputime(basisConstructionTime) |
| 3220 | 3225 |
basisConstructionsCount += 1 |
| 3221 |
""" |
|
| 3226 |
|
|
| 3222 | 3227 |
#### Compute the matrix to reduce. |
| 3223 | 3228 |
matrixToReduce = slz_compute_initial_lattice_matrix(intIntP, |
| 3224 | 3229 |
alpha, |
| 3225 | 3230 |
N, |
| 3226 | 3231 |
iBound, |
| 3227 |
tBound) |
|
| 3232 |
tBound, |
|
| 3233 |
True) |
|
| 3228 | 3234 |
matrixFile = file('/tmp/matrixToReduce.txt', 'w')
|
| 3229 | 3235 |
for row in matrixToReduce.rows(): |
| 3230 | 3236 |
matrixFile.write(str(row) + "\n") |
| 3231 | 3237 |
matrixFile.close() |
| 3232 |
raise Exception("Deliberate stop here.")
|
|
| 3233 |
""" |
|
| 3238 |
#raise Exception("Deliberate stop here.")
|
|
| 3239 |
|
|
| 3234 | 3240 |
reductionTime = cputime() |
| 3235 | 3241 |
#### Compute the reduced polynomials. |
| 3236 | 3242 |
ccReducedPolynomialsList = \ |
Formats disponibles : Unified diff