Révision 114

pobysoPythonSage/src/sageSLZ/sagePolynomialOperations.sage (revision 114)
812 812
        for iPower in xrange(1, pIdegree + 1):
813 813
            iCurrentPower = pIdegree + iPower
814 814
            for tPower in xrange(pPower-1, 0, -1):
815
                print "tPower:", tPower
815
                #print "tPower:", tPower
816 816
                if columnsWidth != 0:
817 817
                    polExpStr = spo_expression_as_string(iCurrentPower, iBound,
818 818
                                                         tPower, tBound, 
pobysoPythonSage/src/sageSLZ/sageSLZ.sage (revision 114)
137 137
    return reducedPolynomials 
138 138
# End slz_compute_reduced_polynomials.
139 139

  
140
def slz_compute_scaled_function(functionSa, \
141
                                      lowerBoundSa, \
142
                                      upperBoundSa, \
143
                                      floatingPointPrecSa):
140
def slz_compute_scaled_function(functionSa,
141
                                lowerBoundSa,
142
                                upperBoundSa,
143
                                floatingPointPrecSa):
144 144
    """
145 145
    From a function, compute the scaled function whose domain
146 146
    is included in [1, 2) and whose image is also included in [1,2).
......
346 346

  
347 347
def slz_interval_scaling_expression(boundsInterval, expVar):
348 348
    """
349
    Compute the scaling expression to map an interval that span only
350
    a binade to [1, 2) and the inverse expression as well.
349
    Compute the scaling expression to map an interval that span at most
350
    a single binade to [1, 2) and the inverse expression as well.
351 351
    Not very sure that the transformation makes sense for negative numbers.
352 352
    """
353 353
    # The scaling offset is only used for negative numbers.

Formats disponibles : Unified diff