Laboratoire de l'Informatique et du Parallélisme » Pobyso

    if precSa is None:

        precSa = polySa.parent().base_ring().precision()

    if (precSa > initialSollyaPrecSa):

        if precSa <= 2:

            print inspect.stack()[0][3], ": precision change <= 2 requested"

        precSo = pobyso_constant_from_int(precSa)

                                                debug=False):

    if debug:

        print "Input arguments:"

        print "________________"

    approxAccurSa        = pobyso_get_constant_as_rn_so_sa(approxAccurSo)

    currentApproxErrorSa = pobyso_get_constant_as_rn_so_sa(currentApproxErrorSo)

    intervalSa           = pobyso_range_to_interval_so_sa(intervalSo)

    if debug:

        print "currentApproxErrorSa  :", currentApproxErrorSa 

    ### Start with a 0 value expression.

    radiusSa = intervalSa.absolute_diameter() / 2

    if debug:

            else:

                roundingPowerSa = \

                    floor(((currentRadiusPowerSa/roundedPolyApproxAccurSa)*(degreeSa+1)).log2())

            if debug:

                print "roundedPolyApproxAccurSa", roundedPolyApproxAccurSa

                print "currentRadiusPowerSa", currentRadiusPowerSa

        errorTypeIsNone = False

    #

    if accuracySo is None:

        accuracySo = pobyso_constant_sa_so(RR(2**(-40)))

        accuracyIsNone = True

    else:

            slz_interval_and_polynomial_to_sage((prceSo[0], prceSo[0],

                                                 prceSo[1], prceSo[2], 

                                                 prceSo[3]))

        intvl = RRIF(intvl)

        ## Clean-up Sollya stuff.

        for elem in prceSo:

            print "Least common multiple:", leastCommonMultiple

        basisConstructionsFullTime        += cputime(basisConstructionTime)

        basisConstructionsCount           += 1

        #### Compute the matrix to reduce.

        matrixToReduce = slz_compute_initial_lattice_matrix(intIntP,

                                                            alpha,

                                                            N,

                                                            iBound,

        matrixFile = file('/tmp/matrixToReduce.txt', 'w')

        for row in matrixToReduce.rows():

            matrixFile.write(str(row) + "\n")

        matrixFile.close()

        reductionTime                     = cputime()

        #### Compute the reduced polynomials.

        ccReducedPolynomialsList =  \

                                       alpha,

                                       N,

                                       iBound,

    """

    For a given set of arguments (see below), compute the initial lattice

    that could be reduced. 

                                                protoMatrix,

                                                0)

    matrixToReduce = spo_proto_to_row_matrix(protoMatrix)

    return matrixToReduce

# End slz_compute_initial_lattice_matrix.

    - the center of the interval;

    - the maximum error in the approximation of the input functionSo by the

      output polynomial ; this error <= approxAccurSaS.

        extra verbose.

    """

    print"In slz_compute_polynomial_and_interval..."

    print "maxPrecSo: ",        ; pobyso_autoprint(maxPrecSo)

    print "approxAccurSo: ",    ; pobyso_autoprint(approxAccurSo)

    (roundedPolySo, roundedPolyMaxErrSo) = \

    sollya_lib_clear_obj(polySo)

    sollya_lib_clear_obj(maxErrorSo)