You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
* Add ``gr_series`` as a public module (contains both the ``gr_series`` and ``gr_series_mod`` types) (FJ).
23
+
* Add directed rounding support for ``nfloat`` (FJ).
24
+
* Matrix permanents (``gr_mat_permanent``, ``fmpz_mat_permanent`` and ``fmpq_mat_permanent``) (FJ).
25
+
* Add the ``fmpz_mod_mpoly_q`` module for multivariate rational functions over a prime field (AY).
26
+
* Gröbner basis computation for ``fmpz_mod_mpoly`` (AY).
27
+
* Add ``nmod_poly_minimal_irreducible`` and ``fq_nmod_ctx_init_minimal_weight_ui``
28
+
for generating irreducible polynomials with minimal weight for any word-size prime
29
+
``p`` and degree ``n``, and use these by default to construct a finite extension field when a Conway polynomial is not available (FJ).
30
+
* Fast multipoint evaluation and interpolation on geometrically spaced points for ``nmod_poly`` (ES, VN, MH).
31
+
* Add a debug context for generics (``gr_ctx_init_debug``) (FJ).
32
+
* Add ``_nmod_vec_invert`` (VN).
33
+
* Add ``gr_ctx_ngens`` and ``gr_ctx_gen_name`` (MM).
34
+
* Preconditioned modular multiplication for ``nmod_poly`` (FJ).
35
+
* Add uniformly random functions for various modular types (including ``_nmod_vec_rand``, ``nmod_mat_rand``, ``fmpz_mod_mat_rand``) (DL).
36
+
* Add Kronecker substitution multiplication for ``gr_poly`` (FJ).
37
+
* Add ``gr_poly_mullow_complex_reorder`` (FJ).
38
+
* Add ``_gr_mpoly_normalise`` to remove zero coefficients (RB).
39
+
* Add ``gr_mpoly_derivative`` and ``gr_mpoly_integral`` (RB).
40
+
* Add ``gr_derivative_gen``, with implementations for polynomial rings (RB).
41
+
* Add ``gr_poly_mullow_classical`` as a standalone function (FJ).
42
+
* Support ``truth_t`` in ``flint_printf`` (FJ).
43
+
* Add ``delta``, ``eta`` parameters to ``arb_mat_spd_lll_reduce`` and ``arb_mat_spd_is_lll_reduced`` (JK).
44
+
* QR and LQ factorization of matrices (``gr_mat_qr``, ``gr_mat_lq``) (FJ).
45
+
* Add ``gr_mat_is_orthogonal`` (FJ).
46
+
* Add ``gr_mat_randtest_orthogonal`` (FJ).
47
+
* Add ``fmpq_poly_discriminant`` (K3).
48
+
* Add ``gr_mat_is_row_lll_reduced_naive`` (FJ).
49
+
* Add generic Newton solver for series solutions of linear systems of ODEs with rational function coefficients (``gr_mat_gr_poly_solve_lode_newton``) (RB).
50
+
* Add ``nfloat_complex_sqrt`` and ``nfloat_complex_rsqrt`` (FJ).
51
+
* Generate power series contexts in ``gr_ctx_init_random`` (FJ).
52
+
* Functions for converting a ``gr_poly`` between the standard monomial basis and a Newton basis (FJ).
53
+
* Polynomial interpolation for ``gr_poly`` (Newton basis and asymptotically fast) (FJ).
54
+
* Add ``gr_poly_product_roots`` (FJ).
55
+
* Add ``fmpq_poly_interpolate_fmpq_vec`` (RP).
56
+
* Add error handling to ``fmpz_poly_interpolate_fmpz_vec`` (FJ).
57
+
* Add ``fmpz_poly_interpolate_exact`` for faster exact interpolation without error handling (FJ).
* Fix erroneous bounds in ``_fmpz_mat_bound_ovals_of_cassini``, which would lead ``fmpz_mat_minpoly`` to compute wrong results for some matrices (CF).
63
+
* Fix ``fmpq_poly_resultant_modular_div``, ``fmpz_poly_resultant_modular_div`` and ``nf_elem_norm_div`` with non-monic polynomials (CF).
64
+
* Fix initial value selection in ``acb_poly_find_roots`` preventing convergence for certain polynomials with coefficients in geometric progression (FJ).
65
+
* Fix ``gr_re`` and ``gr_conj`` for ``nfloat_complex`` (FJ).
66
+
* Fix memory corruption bug in ``nmod_mpoly_divides_heap_threaded`` (FJ, DS).
67
+
* Fix and test edge cases in ``fmpz_set_str`` (DW).
68
+
* Enable accidently disabled ``gr_poly`` test (MM).
69
+
* Consistently throw ``FLINT_DIVZERO`` when trying to divide by zero (LG).
70
+
* Fix bug in ``gr_poly_div_series_basecase``: this would previously return ``GR_DOMAIN`` in some cases where the quotient actually exists (FJ).
71
+
* Correct semantics for generic series: operations on ``gr_series`` should no longer create enclosures for elements that don't exist (FJ).
72
+
* Fix ``gr_poly_shift_equivalent`` in positive characteristic (MM).
73
+
* Fix a memory leak in nmod_mpoly_gcd and improve test coverage of this function (FJ).
74
+
75
+
* Performance
76
+
77
+
* Use ``nfloat``, ``arf`` and ``arb`` arithmetic instead of ``mpf``, ``mpfr`` and ``fmpq`` in ``fmpz_lll``, greatly speeding up multiprecision LLL (FJ).
78
+
* Use SQUFOF in ``fmpz_factor`` to speed up factorisations of cofactors in the 65-80 bit range (FJ).
79
+
* Reduce multiplication depth in ``_gr_poly_compose_axnc`` (U2).
80
+
* Improve precision in ``arb_set_str``, making it more likely to round to nearest (DW).
81
+
* Minor speedup for ``fmpz_poly_compose`` (U2).
82
+
* Speed up ``n_is_prime`` by replacing the BPSW test with smarter strong probable prime tests and other optimisations (FJ).
83
+
* Speed up ``n_factor_one_line`` and ``n_factor_SQUFOF`` by improving the square root computation (FJ).
84
+
* Speed up ``n_factor`` by optimising trial division, doing earlier primality testing, and using the one line factor algorithm for larger bit sizes (FJ).
85
+
* When possible speed up ``nmod_poly`` multiplication via ``fft_small`` by a factor two for tiny moduli by packing a linear polynomial into each coefficient (FJ).
86
+
* Add AVX2 version of ``nmod_vec_dot_half`` (VN).
87
+
* Improve speed and accuracy for ``arb_min`` and ``arb_max`` with non-overlapping input (JD).
88
+
* Speed up ``_fmpz_vec_scalar_divexact_si``, ``_fmpz_vec_scalar_divexact_ui`` and small-divisor ``_fmpz_vec_scalar_divexact_fmpz`` (FJ).
89
+
* Make multivariate polynomial multiplication via nested ``gr_poly`` over various ground types asymptotically fast (FJ).
90
+
* Speed up ``_nmod_poly_divrem_newton_n_preinv`` for sparse moduli by handling these specially (FJ).
91
+
* Incorporate trial division in ``nmod_poly_is_irreducible`` when the prime is small (FJ).
92
+
* Speed up ``nmod_poly`` modular composition by using rectangular splitting instead of Horner for the third step of Brent-Kung (FJ).
93
+
* Faster preconditioned multiplication and polynomial GCD for ``mpn_mod`` (FJ).
94
+
* Improve ``fmpq_poly_interpolate_fmpz_vec`` by incorporating an asymptotically fast multimodular algorithm and other improvements (RP).
95
+
* Improve ``fmpz_poly_interpolate_fmpz_vec`` by incorporating an asymptotically fast multimodular algorithm and other improvements (FJ).
96
+
* Make various ``gr_poly`` functions more robust or performant when dealing with inexact representations of zero (FJ).
97
+
98
+
* Build system, general maintenance
99
+
100
+
* Fix issues with profiling code on Clang (AA).
101
+
* Mark many internal functions as ``static`` (AA).
102
+
* Compile with ``-Wmissing-prototypes`` by default (AA).
103
+
* Fix many compiler warnings (AA).
104
+
* Fix ``acb_theta_all`` and ``acb_theta_one`` disappearing from the shared library (AA).
105
+
* Add V Makefile variable for verbose builds (DT).
0 commit comments