Home
last modified time | relevance | path

Searched refs:pol1 (Results 1 – 25 of 168) sorted by relevance

1234567

/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly_factor/test/
H A Dt-factor.c45 nmod_poly_init(pol1, modulus); in main()
50 nmod_poly_zero(pol1); in main()
51 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
86 nmod_poly_mul(pol1, pol1, poly); in main()
133 nmod_poly_clear(pol1); in main()
153 nmod_poly_init(pol1, modulus); in main()
158 nmod_poly_zero(pol1); in main()
176 nmod_poly_mul(pol1, pol1, poly); in main()
198 nmod_poly_mul(pol1, pol1, poly); in main()
[all …]
H A Dt-factor_berlekamp.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
43 nmod_poly_init(pol1, modulus); in main()
51 nmod_poly_randtest(pol1, state, length); in main()
52 if (pol1->length) in main()
53 nmod_poly_make_monic(pol1, pol1); in main()
55 while ((!nmod_poly_is_irreducible(pol1)) || (pol1->length < 2)); in main()
67 nmod_poly_divrem(quot, rem, pol1, poly); in main()
72 nmod_poly_mul(pol1, pol1, poly); in main()
76 nmod_poly_factor_berlekamp(res, pol1); in main()
87 nmod_poly_clear(pol1); in main()
H A Dt-factor_cantor_zassenhaus.c32 nmod_poly_t pol1, poly, quot, rem; in main() local
41 nmod_poly_init(pol1, modulus); in main()
46 nmod_poly_zero(pol1); in main()
47 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
62 nmod_poly_mul(pol1, pol1, poly); in main()
84 nmod_poly_mul(pol1, pol1, poly); in main()
88 nmod_poly_factor_cantor_zassenhaus(res, pol1); in main()
97 nmod_poly_init(product, pol1->mod.n); in main()
103 lead = pol1->coeffs[pol1->length - 1]; in main()
105 result &= nmod_poly_equal(pol1, product); in main()
[all …]
H A Dt-factor_squarefree.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
44 nmod_poly_init(pol1, modulus); in main()
49 nmod_poly_zero(pol1); in main()
50 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
77 nmod_poly_divrem(quot, rem, pol1, poly); in main()
88 nmod_poly_mul(pol1, pol1, poly); in main()
92 nmod_poly_factor_squarefree(res, pol1); in main()
117 nmod_poly_clear(pol1); in main()
/dports/math/e-antic/flint2-ae7ec89/nmod_poly_factor/test/
H A Dt-factor.c45 nmod_poly_init(pol1, modulus); in main()
50 nmod_poly_zero(pol1); in main()
51 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
86 nmod_poly_mul(pol1, pol1, poly); in main()
133 nmod_poly_clear(pol1); in main()
153 nmod_poly_init(pol1, modulus); in main()
158 nmod_poly_zero(pol1); in main()
176 nmod_poly_mul(pol1, pol1, poly); in main()
198 nmod_poly_mul(pol1, pol1, poly); in main()
[all …]
H A Dt-factor_berlekamp.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
43 nmod_poly_init(pol1, modulus); in main()
51 nmod_poly_randtest(pol1, state, length); in main()
52 if (pol1->length) in main()
53 nmod_poly_make_monic(pol1, pol1); in main()
55 while ((!nmod_poly_is_irreducible(pol1)) || (pol1->length < 2)); in main()
67 nmod_poly_divrem(quot, rem, pol1, poly); in main()
72 nmod_poly_mul(pol1, pol1, poly); in main()
76 nmod_poly_factor_berlekamp(res, pol1); in main()
87 nmod_poly_clear(pol1); in main()
H A Dt-factor_cantor_zassenhaus.c32 nmod_poly_t pol1, poly, quot, rem; in main() local
41 nmod_poly_init(pol1, modulus); in main()
46 nmod_poly_zero(pol1); in main()
47 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
62 nmod_poly_mul(pol1, pol1, poly); in main()
84 nmod_poly_mul(pol1, pol1, poly); in main()
88 nmod_poly_factor_cantor_zassenhaus(res, pol1); in main()
97 nmod_poly_init(product, pol1->mod.n); in main()
103 lead = pol1->coeffs[pol1->length - 1]; in main()
105 result &= nmod_poly_equal(pol1, product); in main()
[all …]
H A Dt-factor_squarefree.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
44 nmod_poly_init(pol1, modulus); in main()
49 nmod_poly_zero(pol1); in main()
50 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
77 nmod_poly_divrem(quot, rem, pol1, poly); in main()
88 nmod_poly_mul(pol1, pol1, poly); in main()
92 nmod_poly_factor_squarefree(res, pol1); in main()
117 nmod_poly_clear(pol1); in main()
/dports/math/flint2/flint-2.8.4/nmod_poly_factor/test/
H A Dt-factor.c45 nmod_poly_init(pol1, modulus); in main()
50 nmod_poly_zero(pol1); in main()
51 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
86 nmod_poly_mul(pol1, pol1, poly); in main()
133 nmod_poly_clear(pol1); in main()
153 nmod_poly_init(pol1, modulus); in main()
158 nmod_poly_zero(pol1); in main()
176 nmod_poly_mul(pol1, pol1, poly); in main()
198 nmod_poly_mul(pol1, pol1, poly); in main()
[all …]
H A Dt-factor_berlekamp.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
43 nmod_poly_init(pol1, modulus); in main()
51 nmod_poly_randtest(pol1, state, length); in main()
52 if (pol1->length) in main()
53 nmod_poly_make_monic(pol1, pol1); in main()
55 while ((!nmod_poly_is_irreducible(pol1)) || (pol1->length < 2)); in main()
67 nmod_poly_divrem(quot, rem, pol1, poly); in main()
72 nmod_poly_mul(pol1, pol1, poly); in main()
76 nmod_poly_factor_berlekamp(res, pol1); in main()
87 nmod_poly_clear(pol1); in main()
H A Dt-factor_cantor_zassenhaus.c32 nmod_poly_t pol1, poly, quot, rem; in main() local
41 nmod_poly_init(pol1, modulus); in main()
46 nmod_poly_zero(pol1); in main()
47 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
62 nmod_poly_mul(pol1, pol1, poly); in main()
84 nmod_poly_mul(pol1, pol1, poly); in main()
88 nmod_poly_factor_cantor_zassenhaus(res, pol1); in main()
97 nmod_poly_init(product, pol1->mod.n); in main()
103 lead = pol1->coeffs[pol1->length - 1]; in main()
105 result &= nmod_poly_equal(pol1, product); in main()
[all …]
H A Dt-factor_squarefree.c36 nmod_poly_t pol1, poly, quot, rem; in main() local
44 nmod_poly_init(pol1, modulus); in main()
49 nmod_poly_zero(pol1); in main()
50 nmod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 nmod_poly_mul(pol1, pol1, poly); in main()
77 nmod_poly_divrem(quot, rem, pol1, poly); in main()
88 nmod_poly_mul(pol1, pol1, poly); in main()
92 nmod_poly_factor_squarefree(res, pol1); in main()
117 nmod_poly_clear(pol1); in main()
/dports/math/e-antic/flint2-ae7ec89/fq_poly_factor_templates/test/
H A Dt-factor.c47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
61 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
140 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
162 TEMPLATE(T, poly_init) (pol1, ctx); in main()
167 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
168 TEMPLATE(T, poly_one) (pol1, ctx); in main()
179 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
197 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
[all …]
H A Dt-factor_squarefree.c40 TEMPLATE(T, poly_t) pol1, poly, quot, rem; in main()
47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_one) (pol1, ctx); in main()
67 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_divrem) (quot, rem, pol1, poly, ctx); in main()
91 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
95 TEMPLATE(T, poly_factor_squarefree) (res, pol1, ctx); in main()
122 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_poly_factor_templates/test/
H A Dt-factor.c47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
61 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
140 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
162 TEMPLATE(T, poly_init) (pol1, ctx); in main()
167 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
168 TEMPLATE(T, poly_one) (pol1, ctx); in main()
179 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
197 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
[all …]
H A Dt-factor_squarefree.c40 TEMPLATE(T, poly_t) pol1, poly, quot, rem; in main()
47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_one) (pol1, ctx); in main()
67 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_divrem) (quot, rem, pol1, poly, ctx); in main()
91 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
95 TEMPLATE(T, poly_factor_squarefree) (res, pol1, ctx); in main()
122 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
/dports/math/flint2/flint-2.8.4/fq_poly_factor_templates/test/
H A Dt-factor.c47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
61 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
140 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
162 TEMPLATE(T, poly_init) (pol1, ctx); in main()
167 TEMPLATE(T, poly_zero) (pol1, ctx); in main()
168 TEMPLATE(T, poly_one) (pol1, ctx); in main()
179 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
197 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
[all …]
H A Dt-factor_squarefree.c40 TEMPLATE(T, poly_t) pol1, poly, quot, rem; in main()
47 TEMPLATE(T, poly_init) (pol1, ctx); in main()
52 TEMPLATE(T, poly_one) (pol1, ctx); in main()
67 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
79 TEMPLATE(T, poly_divrem) (quot, rem, pol1, poly, ctx); in main()
91 TEMPLATE(T, poly_mul) (pol1, pol1, poly, ctx); in main()
95 TEMPLATE(T, poly_factor_squarefree) (res, pol1, ctx); in main()
122 TEMPLATE(T, poly_clear) (pol1, ctx); in main()
/dports/math/e-antic/flint2-ae7ec89/fmpz_poly/
H A Dmulhigh_karatsuba_n.c20 void _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1,
35 _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1, in _fmpz_poly_mulhigh_kara_recursive() argument
44 _fmpz_poly_mulhigh_classical(out, pol1, length, pol2, length, in _fmpz_poly_mulhigh_kara_recursive()
49 _fmpz_vec_add(out, pol1, pol1 + m1, m1); in _fmpz_poly_mulhigh_kara_recursive()
51 fmpz_set(out + m1, pol1 + 2 * m1); in _fmpz_poly_mulhigh_kara_recursive()
103 fmpz *pol1, *pol2; in fmpz_poly_mulhigh_karatsuba_n() local
113 pol1 = (fmpz *) flint_calloc(len, sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
114 memcpy(pol1, poly1->coeffs, poly1->length * sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
118 pol1 = poly1->coeffs; in fmpz_poly_mulhigh_karatsuba_n()
132 _fmpz_poly_mulhigh_karatsuba_n(res->coeffs, pol1, pol2, len); in fmpz_poly_mulhigh_karatsuba_n()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/
H A Dmulhigh_karatsuba_n.c20 void _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1,
35 _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1, in _fmpz_poly_mulhigh_kara_recursive() argument
44 _fmpz_poly_mulhigh_classical(out, pol1, length, pol2, length, in _fmpz_poly_mulhigh_kara_recursive()
49 _fmpz_vec_add(out, pol1, pol1 + m1, m1); in _fmpz_poly_mulhigh_kara_recursive()
51 fmpz_set(out + m1, pol1 + 2 * m1); in _fmpz_poly_mulhigh_kara_recursive()
103 fmpz *pol1, *pol2; in fmpz_poly_mulhigh_karatsuba_n() local
113 pol1 = (fmpz *) flint_calloc(len, sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
114 memcpy(pol1, poly1->coeffs, poly1->length * sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
118 pol1 = poly1->coeffs; in fmpz_poly_mulhigh_karatsuba_n()
132 _fmpz_poly_mulhigh_karatsuba_n(res->coeffs, pol1, pol2, len); in fmpz_poly_mulhigh_karatsuba_n()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_poly/
H A Dmulhigh_karatsuba_n.c20 void _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1,
35 _fmpz_poly_mulhigh_kara_recursive(fmpz * out, const fmpz * pol1, in _fmpz_poly_mulhigh_kara_recursive() argument
44 _fmpz_poly_mulhigh_classical(out, pol1, length, pol2, length, in _fmpz_poly_mulhigh_kara_recursive()
49 _fmpz_vec_add(out, pol1, pol1 + m1, m1); in _fmpz_poly_mulhigh_kara_recursive()
51 fmpz_set(out + m1, pol1 + 2 * m1); in _fmpz_poly_mulhigh_kara_recursive()
103 fmpz *pol1, *pol2; in fmpz_poly_mulhigh_karatsuba_n() local
113 pol1 = (fmpz *) flint_calloc(len, sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
114 memcpy(pol1, poly1->coeffs, poly1->length * sizeof(fmpz)); in fmpz_poly_mulhigh_karatsuba_n()
118 pol1 = poly1->coeffs; in fmpz_poly_mulhigh_karatsuba_n()
132 _fmpz_poly_mulhigh_karatsuba_n(res->coeffs, pol1, pol2, len); in fmpz_poly_mulhigh_karatsuba_n()
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpz_mod_poly_factor/test/
H A Dt-factor_squarefree.c37 fmpz_mod_poly_t pol1, poly, quot, rem; in main() local
45 fmpz_mod_poly_init(pol1, modulus); in main()
50 fmpz_mod_poly_zero(pol1); in main()
51 fmpz_mod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 fmpz_mod_poly_mul(pol1, pol1, poly); in main()
77 fmpz_mod_poly_divrem(quot, rem, pol1, poly); in main()
89 fmpz_mod_poly_mul(pol1, pol1, poly); in main()
93 fmpz_mod_poly_factor_squarefree(res, pol1); in main()
121 fmpz_mod_poly_clear(pol1); in main()
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_mod_poly_factor/test/
H A Dt-factor_squarefree.c37 fmpz_mod_poly_t pol1, poly, quot, rem; in main() local
45 fmpz_mod_poly_init(pol1, modulus); in main()
50 fmpz_mod_poly_zero(pol1); in main()
51 fmpz_mod_poly_set_coeff_ui(pol1, 0, 1); in main()
65 fmpz_mod_poly_mul(pol1, pol1, poly); in main()
77 fmpz_mod_poly_divrem(quot, rem, pol1, poly); in main()
89 fmpz_mod_poly_mul(pol1, pol1, poly); in main()
93 fmpz_mod_poly_factor_squarefree(res, pol1); in main()
121 fmpz_mod_poly_clear(pol1); in main()
/dports/math/flint2/flint-2.8.4/fmpz_mod_poly_factor/test/
H A Dt-factor_squarefree.c39 fmpz_mod_poly_t pol1, poly, quot, rem; in main() local
48 fmpz_mod_poly_init(pol1, ctx); in main()
53 fmpz_mod_poly_zero(pol1, ctx); in main()
54 fmpz_mod_poly_set_coeff_ui(pol1, 0, 1, ctx); in main()
68 fmpz_mod_poly_mul(pol1, pol1, poly, ctx); in main()
81 fmpz_mod_poly_divrem(quot, rem, pol1, poly, ctx); in main()
93 fmpz_mod_poly_mul(pol1, pol1, poly, ctx); in main()
97 fmpz_mod_poly_factor_squarefree(res, pol1, ctx); in main()
125 fmpz_mod_poly_clear(pol1, ctx); in main()
/dports/math/octave-forge-nlwing2/nlwing2/inst/
H A Dcombinepolars.m23 % @deftypefn{Function File} {pol =} combinepolars (pol1, pol2, coef)
24 % @deftypefnx{Function File} {pol =} combinepolars (pol1, pol2, c1, c2, c)
34 function pol = combinepolars (pol1, pol2, varargin)
45 pol.a0 = c*pol1.a0 + d*pol2.a0;
46 pol.amax = c*pol1.amax + d*pol2.amax;
47 pol.clmax = c*pol1.clmax + d*pol2.clmax;
48 alpha1 = pol1.cl.x; alpha2 = pol2.cl.x;
56 pol.cl = pchip (alpha, c*ppval (pol1.cl, alpha) + d*ppval (pol2.cl, alpha));
58 pol.cd = pchip (alpha, c*ppval (pol1.cd, alpha) + d*ppval (pol2.cd, alpha));
60 if (isfield (pol1, "z"))
[all …]

1234567