"Fossies" - the Fresh Open Source Software Archive

Member "NZMATH-1.2.0/CHANGES.txt" (26 Nov 2012, 9512 Bytes) of package /linux/misc/old/NZMATH-1.2.0.tar.gz:


As a special service "Fossies" has tried to format the requested text file into HTML format (style: standard) with prefixed line numbers. Alternatively you can here view or download the uninterpreted source code file.

    1 version 1.1.0 to 1.2.0
    2 ------------------------
    3 * add a new module sequence for mathematical sequences (like Fibonacci).  
    4 * add a new module poly.array for AKS algolythm.
    5 * add a new method aks in prime by keisuke banchi. 
    6 * add new curves N3 in factor.ecm by naoko nakamura.
    7 * improve factor.mpqs for deciding k such as k*n has many factor base by misuzu kawahara.
    8 * improve combinatorial.permutation_generator.
    9 * fix prime.apr (precisely, Zeta.__mod__) for user request #3418110.
   10 * fix a few bugs in prime_decomp.
   11 
   12 version 1.0.1 to 1.1.0
   13 ------------------------
   14 * add a new module algorithm, module, prime_decomp, poly.groebner.
   15 * add a method normalize in poly.uniutil.IntegerPolynomial
   16 * add a method weight_order in poly.termorder
   17 * add a method nzmath_info in config
   18 * remove classes real.RelativeError, real.AbsoluteError, real.Constant and functions which depend on these classes.
   19 * remove classes imaginary.RelativeError, imaginary.AbsoluteError and functions which depend on these classes.
   20 * fix to load the default config file if an user's file is not found.
   21 * fix not to give warnings by default.
   22 * fix a few bugs in algfield, arith1, poly.termorder
   23 
   24 version 1.0.0 to 1.0.1
   25 ------------------------
   26 * fix a bug with __init__ modules.
   27 
   28 version 0.92.0 to 1.0.0
   29 ------------------------
   30 * add TeX(PDF) manual of each module, class and function.
   31 * add configs for using math/mpmath plugin.
   32 * add functions permutationGenerator and partition_conjugate to combinatorial.
   33 * add methods getConj, integer_ring, field_discriminant in algfield.NumberField.
   34 * add methods getConj, getApprox, getCharPoly in algfield.BasicAlgNumber.
   35 * remove a class algfield.ApproxAlgNumber.
   36 * fix a few bugs in elliptic.
   37 * fix a bug in prime.randPrime.
   38 * fix a bug in round2._kernel_of_qpow.
   39 * fix a bug in combinatorial.combinationIndexGenerator.
   40 
   41 version 0.91.0 to 0.92.0
   42 ------------------------
   43 * add a new module config, ecpp, poly.ratfunc, poly.ring and poly.hensel.
   44 * add functions trace/norm/primitive_element/random_element to finitefield.
   45 * add ExtendedField to finitefield to replace FiniteExtendedField.
   46 * add a function multirange to bigrange.
   47 * add functions root_Fp and allroots_Fp to equation.
   48 * remove deprecated e1_Zn in equation.
   49 * fix a few bugs in algfield.
   50 * fix a few bugs in matrix.
   51 * fix a bug of split_same_degree in poly.uniutil.
   52 
   53 version 0.90.0 to 0.91.0
   54 ------------------------
   55 * add a new module intresidue to obsolete integerResidueClass.
   56 * rewrite finitefield, elliptic to use new polynomial (poly subpackage).
   57 * add card() in compatibility to substitute with builtin len() for sets.
   58 * speed up some polynomial operations, arith1.modsqrt, etc.
   59 
   60 version 0.7.0 to 0.90.0
   61 -----------------------
   62 * change required Python version to 2.5.
   63 * many changes in matrix.
   64 * add new modules algfield, round2 and squarefree.
   65 * add a new module factor in poly sub-package.
   66 * add a new function map_choice in bigrandom.
   67 * add a new function euler in combinatorial.
   68 * add a method getRing to imaginary.Complex to fix sf bug # 1852828.
   69 * add a new class Real in real.
   70 * add a new method generate to factor.util.FactoringMethod.
   71 * add a new method total_degree to classes in poly.multivar.
   72 * add new methods resultant, discriminant and subresultant_extgcd to poly.uniutil.SubresultantGcdProvider.
   73 * add a new class IntegerPolynomial in poly.uniutil.
   74 * add a new method resultant to poly.multiutil.UniqueFactorizationDomainPolynomial.
   75 * change LLL into a function in lattice.
   76 * fix a few bugs in elliptic including sf bug #1913999.
   77 * fix a few bugs in gcd including sf bug #1924839.
   78 * fix a bug in prime._lucas_test_sequence.
   79 * change inplementation of polynomial.resultant.
   80 * a few minor modifications in rational.
   81 
   82 version 0.6.0 to 0.7.0
   83 ----------------------
   84 * add a new sub-package poly for new implementation of polynomials.
   85 * enhance quad module; class group structure, etc.
   86 * add a new module compatibility for easier treatment of sets compatibility.
   87 * add new functions bell, stirling1 and stirling2 in combinatorial.
   88 * add a new function inverse in ring.
   89 * add a new method exact_division to ring.CommutativeRingElement.
   90 * add new methods getCharacteristic and getCommonSuperring to ring.Ring. 
   91 * add a new method permute,setKey,getData to permute.Permute and .ExPermute.
   92 * add a new class PermGroup and move group methods from Permute and .ExPermute.
   93 * fix a bug of equation.Newton.
   94 * fix bugs in finitefield (including sf bug #1751708, #1752666).
   95 * fix a bug of real.AbsoluteError (ML #75 reported by Dino Viehland).
   96 * update matrix to get rid of special treatment of rational integers.
   97 * speed up order and sgn in permute.Permute and .ExPermute.
   98 
   99 version 0.5.1 to 0.6.0
  100 ----------------------
  101 * add a new module arygcd for efficient gcds for some integer rings of imaginary quadratic fields.
  102 * add a new module bigrange for simplifying loops.
  103 * add a new module cubic_root for cubic residues and cubic roots for some integer rings of imaginary quadratic fields.
  104 * add a new module factor.ecm for elliptic curve method factorization.
  105 * add partition_numbers_upto and partition_number functions in combinatorial.
  106 * fix a bug of arith1.AGM function. (sf bug #1600223)
  107 * fix a bug of bigrandom.random function. (sf bug #1590692)
  108 * fix a bug of equation.e2_Fp and add e1_ZnZ to the module.
  109 
  110 version 0.5.0 to 0.5.1
  111 ----------------------
  112 * restructure matrix module.
  113 * restructure ec module.
  114 * revise vector module.
  115 * add zero and one for ResidueClassRing (requested by Bill Hale).
  116 * add bsgs to quad.
  117 * add lpsp and fpsp (Lucas and Frobenius pseudoprime tests) to prime.
  118 * add __hash__ for several immutable classes.
  119 * fix a bug of SimMethod in equation.
  120 * fix bugs in polynomial.
  121 * fix bugs in ring.
  122 
  123 version 0.4.1 to 0.5.0
  124 ----------------------
  125 * rearrange modules in factor sub-package.
  126 * add a new module quad for computing class numbers of imaginary quadratic fields.
  127 * add new modules group and perm for group order computation and calculations of permutation groups.
  128 * fix a bug of issquare function in arith1.
  129 * fix a bug of e3 function in equation.
  130 * move zassenhaus.combinationIndexGenerator to combinatorial.
  131 * add functions coprime and pairwise_coprime to gcd.
  132 * add a function log to arith1.
  133 * add a method smith to matrix.IntegerMatrix.
  134 * add functions fallingfactorial, risingfactorial, multinomial and partitionGenerator to combinatorial.
  135 
  136 version 0.4.0 to 0.4.1
  137 ----------------------
  138 * fix a bug of Schoof's method, EC.point, etc. in elliptic.
  139 * fix a bug of integrate method in polynomial.
  140 * fix a bug of e3_Fp function in equation.
  141 * move elliptic.divi to factor.AllDivisors.
  142 * rename arith1.sqroot to modsqrt and remove resembles in factor sub-package.
  143 * move vp from prime to arith1 and remove factor.factor.ord.
  144 * remove dependency on factor.trialDivision from prime.
  145 * move issquare from factor to arith1.
  146 * add a function getRing in ring.
  147 * add a function mpqsfind in factor.mpqs.
  148 * add a method order to finitefield.FinitePrimeFieldElement.
  149 * add generator_eratosthenes to prime (EXPERIMENTAL).
  150 
  151 version 0.3.1 to 0.4.0
  152 ----------------------
  153 * add new modules equation providing a root finding methods and zassenhaus providing factorization of integer coefficient polynomials.
  154 * fix some bugs in factor.factor and polynomial.
  155 * add a method to culculate Mordel-Weil group structure of elliptic curve over finite fields. 
  156 * add a function floorpowerroot in arith1.
  157 * add functions bernoulli and catalan in combinatorial.
  158 * add a function PrimePowerTest in factor.factor.
  159 * add a function sigma in multiplicative.
  160 
  161 version 0.3.0 to 0.3.1
  162 ----------------------
  163 * fix import problem, and include finitefield.py mistakenly missing in 0.3.0.
  164 
  165 version 0.2.1 to 0.3.0
  166 ----------------------
  167 * create a new module multiplicative.py with euler and moebius
  168   from arith1.py to avoid circular import.
  169 
  170 version 0.2.0 to 0.2.1
  171 ----------------------
  172 * include some missing files in 0.2.0.
  173 
  174 Version 0.1.1 to 0.2.0
  175 ----------------------
  176 * add a new module factor.mpqs, which provides multi-polynomial
  177   quadratic sieve method.
  178 * add a method to culculate order of elliptic curve over finite fields.
  179 * rewrite polynomial.py for one variable polynomials.
  180 * rewrite real.py and imaginary.py.
  181 * fix bug in matrix.py (reported by Justin Walker).
  182 * many other bug fixes.
  183 * create a tutorial.txt document.
  184 
  185 Version 0.1.0 to 0.1.1
  186 ----------------------
  187 * BSD-licensed.
  188 * add a constant j to imaginary.
  189 * intializing Rational with denominator 0 raises ZeroDivisionError.
  190 * fix bugs in real.py and elliptic.py.
  191 
  192 Version 0.0.1 to 0.1.0
  193 ----------------------
  194 * add new module elliptic for elliptic curve operations.
  195 * remove optional argument for generator in prime.py. Condition may
  196   be specified with itertools instead.
  197 * add new module finitefield for finite field.  It only includes
  198   finite prime field at the present moment.
  199 * add new module combinatrial including binomial and factorial.
  200 * add issubring and issuperring to Ring in ring.py.
  201 * add mpqs function (multi-polynomial quadratic sieve) in factor.py.
  202 * add IntegerIfIntOrLong function in rational.py.
  203 * add LUDecomposition method to Matrix in matrix.py.
  204 * now you can factor a very big but very smooth integer by trial division.
  205 * speed up real.log, and it now accepts float.
  206 * fix bugs in rational.py, integerResidueClass.py, etc..
  207 
  208 Version 0.0.0 to 0.0.1
  209 ----------------------
  210 * add __long__ and __int__ methods to Rational in rational.py.
  211 * add gcd method to PolynomialRing in polynomial.py.
  212 * fix bugs in matrix.py, polynomial.py.