Re: [sage-devel] Re: [ANN] Flint 2.5 released
the flint upgrade #19009 needs review! On 10/08/15 13:36, Vincent Delecroix wrote: I created #19009 for the upgrade in Sage. On 08/08/15 11:59, 'Bill Hart' via sage-devel wrote: I just updated the tarballs to fix an issue noted with the MSVC build. Note, this only affects Windows when building with MSVC, hence I didn't push the patch number. Bill. On 7 August 2015 at 23:33, Bill Hart goodwillh...@googlemail.com wrote: Hi all, We are very pleased to present Flint version 2.5.0. It can be downloaded from our website: http://http://flintlib.org/ FLINT is a C library for arithmetic in support of Number Theory, including polynomial arithmetic and linear algebra over Z, Z/nZ, Q, p-adics, q-adics, F_q, and univariate factorisation over those rings. It depends on GMP or MPIR and MPFR. New features/improvements in this release include: * LLL (rational, Nguyen-Stehle, from Gram matrix, with_removal, Storjohann/ULLL) [1] * Hermite normal form (naive, xgcd, Domich-Kannan-Trotter, Kannan-Bachem, Pernet-Stein) [1] * Smith normal form (diagonal, Kannen-Bachem, Iliopoulos) [1] * Paterson-Stockmeyer algorithm * modular resultant * half gcd style resultant * polynomial discriminant * multithreaded multimodular Taylor shift * multithreaded Brent-Kung composition * multithreaded Kaltofen-Shoup distinct degree factorisation * multiplication based reduced row echelon form * inline functions included in library for use by foreign function interfaces * Primality tests for large integers (Pocklington, Morrison) * Probable prime tests for large integers (Lucas, Baillie-PSW, strong-psp, Brillhart-Lehmer-Selfridge) * CRT for large integers * Dixon algorithm for nullspace [1] * Brent-Kung composition in irreducibility and distinct degree factorisation * floating point QR decomposition * Schwarz-Rutishauser Gram-Schmidt algorithm * Ogita-Rump-Oishi dot product * matrix window functions * MSVC support (Brian Gladman) * fast cube/nth-root (Newton, Kahan, magic number, Chebyshev) * Bodrato matrix squaring * matrix concatenation functions * matrix content * faster n_gcd * faster n_sqrtmod and fmpz_sqrtmod * additional functions for returning factor of modulus in polys over Z/nZ * Hadamard matrix construction * series addition/subtraction * faster prime_pi bounds * speedup creation of sparse polynomials * speedup n_isprime and n_nextprime * speedup n_isprime_pocklington * speedups to fmpq_poly and fmpz_poly arithmetic * speedup polynomial irreducibility testing over Z/pZ * speedup of rank computation over ZZ * made CPimport compile time dependency only * teach flint_printf/sprintf about explicit width format specifiers * support relative paths in configure * library soname versioning * ARM64 patches * Support MSYS2 * Progress towards supporting MIPS64 * Many build system improvements * Fix a serious bug in fmpz_poly_signature Contributors to this release include: Abinhav Baid, Alex Best, Fredrik Johansson, William Hart, Brian Gladman, Jean-Pierre Flori, Martin Lee, Curtis Bright, Daniel Fabian, Julian Ospald, Dan Grayson, Dana Jacobsen, Vladimir Glazachev, Kushagra Singh, Ashish Kedia, Anubhav Srivistava, Prabhdeep Singh, Alena Sergeicheva, Sebastian Pancratz, mgkurtz, Tommy Hofmann, Daniel Roche, Max Goldfar, Andreas Enge, Francois Bissey, Denis Kryskov, Anton Mellit, and numerous others. [1] Thanks to Google for funding students through its Google Summer of Code. Abinhav Baid and Alex Best contributed to Flint through this program. Best wishes, The Flint Development Team. -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
Re: [sage-devel] Re: [ANN] Flint 2.5 released
I created #19009 for the upgrade in Sage. On 08/08/15 11:59, 'Bill Hart' via sage-devel wrote: I just updated the tarballs to fix an issue noted with the MSVC build. Note, this only affects Windows when building with MSVC, hence I didn't push the patch number. Bill. On 7 August 2015 at 23:33, Bill Hart goodwillh...@googlemail.com wrote: Hi all, We are very pleased to present Flint version 2.5.0. It can be downloaded from our website: http://http://flintlib.org/ FLINT is a C library for arithmetic in support of Number Theory, including polynomial arithmetic and linear algebra over Z, Z/nZ, Q, p-adics, q-adics, F_q, and univariate factorisation over those rings. It depends on GMP or MPIR and MPFR. New features/improvements in this release include: * LLL (rational, Nguyen-Stehle, from Gram matrix, with_removal, Storjohann/ULLL) [1] * Hermite normal form (naive, xgcd, Domich-Kannan-Trotter, Kannan-Bachem, Pernet-Stein) [1] * Smith normal form (diagonal, Kannen-Bachem, Iliopoulos) [1] * Paterson-Stockmeyer algorithm * modular resultant * half gcd style resultant * polynomial discriminant * multithreaded multimodular Taylor shift * multithreaded Brent-Kung composition * multithreaded Kaltofen-Shoup distinct degree factorisation * multiplication based reduced row echelon form * inline functions included in library for use by foreign function interfaces * Primality tests for large integers (Pocklington, Morrison) * Probable prime tests for large integers (Lucas, Baillie-PSW, strong-psp, Brillhart-Lehmer-Selfridge) * CRT for large integers * Dixon algorithm for nullspace [1] * Brent-Kung composition in irreducibility and distinct degree factorisation * floating point QR decomposition * Schwarz-Rutishauser Gram-Schmidt algorithm * Ogita-Rump-Oishi dot product * matrix window functions * MSVC support (Brian Gladman) * fast cube/nth-root (Newton, Kahan, magic number, Chebyshev) * Bodrato matrix squaring * matrix concatenation functions * matrix content * faster n_gcd * faster n_sqrtmod and fmpz_sqrtmod * additional functions for returning factor of modulus in polys over Z/nZ * Hadamard matrix construction * series addition/subtraction * faster prime_pi bounds * speedup creation of sparse polynomials * speedup n_isprime and n_nextprime * speedup n_isprime_pocklington * speedups to fmpq_poly and fmpz_poly arithmetic * speedup polynomial irreducibility testing over Z/pZ * speedup of rank computation over ZZ * made CPimport compile time dependency only * teach flint_printf/sprintf about explicit width format specifiers * support relative paths in configure * library soname versioning * ARM64 patches * Support MSYS2 * Progress towards supporting MIPS64 * Many build system improvements * Fix a serious bug in fmpz_poly_signature Contributors to this release include: Abinhav Baid, Alex Best, Fredrik Johansson, William Hart, Brian Gladman, Jean-Pierre Flori, Martin Lee, Curtis Bright, Daniel Fabian, Julian Ospald, Dan Grayson, Dana Jacobsen, Vladimir Glazachev, Kushagra Singh, Ashish Kedia, Anubhav Srivistava, Prabhdeep Singh, Alena Sergeicheva, Sebastian Pancratz, mgkurtz, Tommy Hofmann, Daniel Roche, Max Goldfar, Andreas Enge, Francois Bissey, Denis Kryskov, Anton Mellit, and numerous others. [1] Thanks to Google for funding students through its Google Summer of Code. Abinhav Baid and Alex Best contributed to Flint through this program. Best wishes, The Flint Development Team. -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
[sage-devel] Re: [ANN] Flint 2.5 released
I just updated the tarballs to fix an issue noted with the MSVC build. Note, this only affects Windows when building with MSVC, hence I didn't push the patch number. Bill. On 7 August 2015 at 23:33, Bill Hart goodwillh...@googlemail.com wrote: Hi all, We are very pleased to present Flint version 2.5.0. It can be downloaded from our website: http://http://flintlib.org/ FLINT is a C library for arithmetic in support of Number Theory, including polynomial arithmetic and linear algebra over Z, Z/nZ, Q, p-adics, q-adics, F_q, and univariate factorisation over those rings. It depends on GMP or MPIR and MPFR. New features/improvements in this release include: * LLL (rational, Nguyen-Stehle, from Gram matrix, with_removal, Storjohann/ULLL) [1] * Hermite normal form (naive, xgcd, Domich-Kannan-Trotter, Kannan-Bachem, Pernet-Stein) [1] * Smith normal form (diagonal, Kannen-Bachem, Iliopoulos) [1] * Paterson-Stockmeyer algorithm * modular resultant * half gcd style resultant * polynomial discriminant * multithreaded multimodular Taylor shift * multithreaded Brent-Kung composition * multithreaded Kaltofen-Shoup distinct degree factorisation * multiplication based reduced row echelon form * inline functions included in library for use by foreign function interfaces * Primality tests for large integers (Pocklington, Morrison) * Probable prime tests for large integers (Lucas, Baillie-PSW, strong-psp, Brillhart-Lehmer-Selfridge) * CRT for large integers * Dixon algorithm for nullspace [1] * Brent-Kung composition in irreducibility and distinct degree factorisation * floating point QR decomposition * Schwarz-Rutishauser Gram-Schmidt algorithm * Ogita-Rump-Oishi dot product * matrix window functions * MSVC support (Brian Gladman) * fast cube/nth-root (Newton, Kahan, magic number, Chebyshev) * Bodrato matrix squaring * matrix concatenation functions * matrix content * faster n_gcd * faster n_sqrtmod and fmpz_sqrtmod * additional functions for returning factor of modulus in polys over Z/nZ * Hadamard matrix construction * series addition/subtraction * faster prime_pi bounds * speedup creation of sparse polynomials * speedup n_isprime and n_nextprime * speedup n_isprime_pocklington * speedups to fmpq_poly and fmpz_poly arithmetic * speedup polynomial irreducibility testing over Z/pZ * speedup of rank computation over ZZ * made CPimport compile time dependency only * teach flint_printf/sprintf about explicit width format specifiers * support relative paths in configure * library soname versioning * ARM64 patches * Support MSYS2 * Progress towards supporting MIPS64 * Many build system improvements * Fix a serious bug in fmpz_poly_signature Contributors to this release include: Abinhav Baid, Alex Best, Fredrik Johansson, William Hart, Brian Gladman, Jean-Pierre Flori, Martin Lee, Curtis Bright, Daniel Fabian, Julian Ospald, Dan Grayson, Dana Jacobsen, Vladimir Glazachev, Kushagra Singh, Ashish Kedia, Anubhav Srivistava, Prabhdeep Singh, Alena Sergeicheva, Sebastian Pancratz, mgkurtz, Tommy Hofmann, Daniel Roche, Max Goldfar, Andreas Enge, Francois Bissey, Denis Kryskov, Anton Mellit, and numerous others. [1] Thanks to Google for funding students through its Google Summer of Code. Abinhav Baid and Alex Best contributed to Flint through this program. Best wishes, The Flint Development Team. -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
