Révision 228 pobysoPythonSage/src/sageSLZ/sageSLZ.sage
| sageSLZ.sage (revision 228) | ||
|---|---|---|
| 359 | 359 |
alpha, |
| 360 | 360 |
N, |
| 361 | 361 |
iBound, |
| 362 |
tBound): |
|
| 362 |
tBound, |
|
| 363 |
debug = False): |
|
| 363 | 364 |
""" |
| 364 | 365 |
For a given set of arguments (see below), compute the initial lattice |
| 365 | 366 |
that could be reduced. |
| ... | ... | |
| 407 | 408 |
protoMatrix, |
| 408 | 409 |
0) |
| 409 | 410 |
matrixToReduce = spo_proto_to_row_matrix(protoMatrix) |
| 411 |
if debug: |
|
| 412 |
print "Initial basis polynomials" |
|
| 413 |
for poly in polynomialsList: |
|
| 414 |
print poly |
|
| 410 | 415 |
return matrixToReduce |
| 411 | 416 |
# End slz_compute_initial_lattice_matrix. |
| 412 | 417 |
|
| ... | ... | |
| 866 | 871 |
- the center of the interval; |
| 867 | 872 |
- the maximum error in the approximation of the input functionSo by the |
| 868 | 873 |
output polynomial ; this error <= approxAccurSaS. |
| 869 |
Changes fom v1: |
|
| 874 |
Changes fom v 01:
|
|
| 870 | 875 |
extra verbose. |
| 871 | 876 |
""" |
| 872 | 877 |
print"In slz_compute_polynomial_and_interval..." |
| ... | ... | |
| 974 | 979 |
print "maxPrecSo: ", ; pobyso_autoprint(maxPrecSo) |
| 975 | 980 |
print "approxAccurSo: ", ; pobyso_autoprint(approxAccurSo) |
| 976 | 981 |
(roundedPolySo, roundedPolyMaxErrSo) = \ |
| 977 |
pobyso_polynomial_coefficients_progressive_round_so_so(polySo,
|
|
| 978 |
functionSo,
|
|
| 979 |
intervalCenterSo,
|
|
| 980 |
currentRangeSo,
|
|
| 981 |
itpSo,
|
|
| 982 |
ftpSo,
|
|
| 983 |
maxPrecSo,
|
|
| 984 |
approxAccurSo)
|
|
| 982 |
pobyso_round_coefficients_progressive_so_so(polySo,
|
|
| 983 |
functionSo, |
|
| 984 |
maxPrecSo,
|
|
| 985 |
currentRangeSo, |
|
| 986 |
intervalCenterSo,
|
|
| 987 |
maxErrorSo,
|
|
| 988 |
approxAccurSo,
|
|
| 989 |
debug = True)
|
|
| 985 | 990 |
|
| 986 | 991 |
sollya_lib_clear_obj(polySo) |
| 987 | 992 |
sollya_lib_clear_obj(maxErrorSo) |
Formats disponibles : Unified diff