I forgot to credit Jan Tuitman who helped design the new padics interface!!
And the documentation is 184 pp. (not 164 pp. as reported). Bill. On 4 June 2011 23:01, Bill Hart <goodwillh...@googlemail.com> wrote: > Hi all, > > We are pleased to present FLINT version 2.2. > > It is available for download at our website (http://www.flintlib.org/): > > Source: http://www.flintlib.org/flint-2.2.tar.gz > Documentation: http://www.flintlib.org/flint-2.2.pdf (165 pp.) > Contributors: Fredrik Johansson, Sebastian Pancratz, William Hart, > with bug reports by Serge Torres. > > For those after the benchmarketing figures, please see: > > http://sage.math.washington.edu/home/fredrik/flint/timings.html > > My personal favourite is determinant of a 10x10 matrix with random > rational coefficients of 100 bits: > > Sage / flint2 > 11 mins 50 s 4.2 milliseconds > > This release contains some fantastic new modules: > > fmpq -- multiple precision rational numbers > > fmpq_mat -- matrices over QQ > > fmpz_poly_mat -- matrices over Z[x], i.e. polynomial matrices > > fmpz_poly_q -- rational functions over Q (quotients of integer polynomials) > > padic -- padic numbers > > Although they are already fairly developed modules, they are still > considered under development (especially the padic module). Some > interface changes are still possible in the future. > > There have also been numerous new functions and improvements made in > the fmpz_mat, longlong, nmod_mat, arith, fmpz, fmpz_vec, fmpz_poly, > nmod_poly and mpn_extras modules and some build fixes. > > Full details can be found at the bottom of the NEWS file: > > https://github.com/fredrik-johansson/flint2/blob/trunk/NEWS > > The following functionality from flint 1.5 is yet to be ported to the > flint 2.x series: > > nmod_poly_gcd_hgcd -- asymptotically fast gcd > nmod_poly_factor_berlekamp -- Z/nZ[x] factorisation > nmod_poly_factor_cantor_zassenhaus -- Z/nZ[x] factorisation > fmpz_poly_mul_SS -- fast Z[x] multiplication for large coefficients > and medium to large lengths > some FFT precaching and middle product functions for > nmod_poly_div_newton -- faster Z/nZ[x] division > > It is expected that this functionality will be completed over the next > 2-3 flint releases. > > Best Wishes, > > The FLINT Team. > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
