本文整理汇总了C++中fmpq_poly_print函数的典型用法代码示例。如果您正苦于以下问题：C++ fmpq_poly_print函数的具体用法？C++ fmpq_poly_print怎么用？C++ fmpq_poly_print使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了fmpq_poly_print函数的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int
main(void)
{
int i, result;
flint_rand_t state;
printf("content....");
fflush(stdout);
flint_randinit(state);
/* Check that content(a f) = abs(a) content(f) */
for (i = 0; i < 10000; i++)
{
fmpq_poly_t f, g;
fmpq_t a, b, c;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_init(a);
fmpq_init(b);
fmpq_init(c);
fmpq_poly_randtest_not_zero(f, state, n_randint(state, 100) + 1, 100);
fmpq_randtest_not_zero(a, state, 100);
fmpq_poly_scalar_mul_fmpq(g, f, a);
fmpq_poly_content(b, g);
fmpq_poly_content(c, f);
fmpq_mul(c, a, c);
fmpq_abs(c, c);
result = (fmpq_equal(b, c));
if (!result)
{
printf("FAIL:\n");
fmpq_poly_print(f), printf("\n\n");
fmpq_poly_print(g), printf("\n\n");
fmpq_print(a), printf("\n\n");
fmpq_print(b), printf("\n\n");
fmpq_print(c), printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_clear(a);
fmpq_clear(b);
fmpq_clear(c);
}
flint_randclear(state);
_fmpz_cleanup();
printf("PASS\n");
return 0;
}示例2: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("legendre_p_ui_root....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100 * arb_test_multiplier(); iter++)
{
ulong n, k;
slong prec;
arb_ptr roots, weights;
arb_poly_t pol;
arb_t s;
fmpq_poly_t pol2;
n = 1 + n_randint(state, 100);
prec = 20 + n_randint(state, 500);
roots = _arb_vec_init(n);
weights = _arb_vec_init(n);
arb_poly_init(pol);
fmpq_poly_init(pol2);
arb_init(s);
for (k = 0; k < n; k++)
{
if (k > n / 2 && n_randint(state, 2))
{
arb_neg(roots + k, roots + n - k - 1);
arb_set(weights + k, weights + n - k - 1);
}
else
{
arb_hypgeom_legendre_p_ui_root(roots + k, weights + k, n, k, prec);
}
}
arb_poly_product_roots(pol, roots, n, prec);
/* fmpq_poly_legendre_p(pol2, n); */
arith_legendre_polynomial(pol2, n);
arb_set_fmpz(s, pol2->coeffs + n);
arb_div_fmpz(s, s, pol2->den, prec);
arb_poly_scalar_mul(pol, pol, s, prec);
if (!arb_poly_contains_fmpq_poly(pol, pol2))
{
flint_printf("FAIL: polynomial containment\n\n");
flint_printf("n = %wu, prec = %wd\n\n", n, prec);
flint_printf("pol = "); arb_poly_printd(pol, 30); flint_printf("\n\n");
flint_printf("pol2 = "); fmpq_poly_print(pol2); flint_printf("\n\n");
flint_abort();
}
arb_zero(s);
for (k = 0; k < n; k++)
{
arb_add(s, s, weights + k, prec);
}
if (!arb_contains_si(s, 2))
{
flint_printf("FAIL: sum of weights\n\n");
flint_printf("n = %wu, prec = %wd\n\n", n, prec);
flint_printf("s = "); arb_printn(s, 30, 0); flint_printf("\n\n");
flint_abort();
}
_arb_vec_clear(roots, n);
_arb_vec_clear(weights, n);
arb_poly_clear(pol);
fmpq_poly_clear(pol2);
arb_clear(s);
}
for (iter = 0; iter < 500 * arb_test_multiplier(); iter++)
{
arb_t x1, x2, w1, w2;
ulong n, k;
slong prec1, prec2;
arb_init(x1);
arb_init(x2);
arb_init(w1);
arb_init(w2);
n = 1 + n_randtest(state) % 100000;
if (n_randint(state, 2) || n == 1)
k = n_randtest(state) % n;
else
k = n / 2 - (n_randtest(state) % (n / 2));
prec1 = 2 + n_randtest(state) % 2000;
prec2 = 2 + n_randtest(state) % 2000;
arb_hypgeom_legendre_p_ui_root(x1, w1, n, k, prec1);
if (n_randint(state, 10) == 0)
//.........这里部分代码省略.........
示例3: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("div_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong m, n, p, qbits, rbits1, rbits2;
fmpq_poly_t A, B, C;
arb_poly_t a, b, c, d;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
p = 1 + n_randint(state, 20);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(c);
arb_poly_init(d);
fmpq_poly_randtest(A, state, m, qbits);
do {
fmpq_poly_randtest_not_zero(B, state, n, qbits);
} while (B->coeffs[0] == 0);
fmpq_poly_div_series(C, A, B, p);
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_set_fmpq_poly(b, B, rbits1);
arb_poly_div_series(c, a, b, p, rbits2);
if (!arb_poly_contains_fmpq_poly(c, C))
{
flint_printf("FAIL\n\n");
flint_printf("bits2 = %wd\n", rbits2);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("B = "); fmpq_poly_print(B); flint_printf("\n\n");
flint_printf("C = "); fmpq_poly_print(C); flint_printf("\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
flint_abort();
}
arb_poly_set(d, a);
arb_poly_div_series(d, d, b, p, rbits2);
if (!arb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 1)\n\n");
flint_abort();
}
arb_poly_set(d, b);
arb_poly_div_series(d, a, d, p, rbits2);
if (!arb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 2)\n\n");
flint_abort();
}
arb_poly_set(d, b);
arb_poly_div_series(c, d, d, p, rbits2);
arb_poly_div_series(d, d, d, p, rbits2);
if (!arb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 3)\n\n");
flint_abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(C);
arb_poly_clear(a);
arb_poly_clear(b);
arb_poly_clear(c);
arb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}示例4: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("mullow_block....");
fflush(stdout);
flint_randinit(state);
/* compare with fmpq_poly */
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong qbits1, qbits2, rbits1, rbits2, rbits3, trunc;
fmpq_poly_t A, B, C;
arb_poly_t a, b, c, d;
qbits1 = 2 + n_randint(state, 1000);
qbits2 = 2 + n_randint(state, 1000);
rbits1 = 2 + n_randint(state, 1000);
rbits2 = 2 + n_randint(state, 1000);
rbits3 = 2 + n_randint(state, 1000);
trunc = n_randint(state, 100);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(c);
arb_poly_init(d);
fmpq_poly_randtest(A, state, 1 + n_randint(state, 100), qbits1);
fmpq_poly_randtest(B, state, 1 + n_randint(state, 100), qbits2);
fmpq_poly_mullow(C, A, B, trunc);
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_set_fmpq_poly(b, B, rbits2);
arb_poly_mullow_block(c, a, b, trunc, rbits3);
if (!arb_poly_contains_fmpq_poly(c, C))
{
flint_printf("FAIL\n\n");
flint_printf("bits3 = %wd\n", rbits3);
flint_printf("trunc = %wd\n", trunc);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("B = "); fmpq_poly_print(B); flint_printf("\n\n");
flint_printf("C = "); fmpq_poly_print(C); flint_printf("\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
abort();
}
arb_poly_set(d, a);
arb_poly_mullow_block(d, d, b, trunc, rbits3);
if (!arb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 1)\n\n");
abort();
}
arb_poly_set(d, b);
arb_poly_mullow_block(d, a, d, trunc, rbits3);
if (!arb_poly_equal(d, c))
{
flint_printf("FAIL (aliasing 2)\n\n");
abort();
}
/* test squaring */
arb_poly_set(b, a);
arb_poly_mullow_block(c, a, b, trunc, rbits3);
arb_poly_mullow_block(d, a, a, trunc, rbits3);
if (!arb_poly_overlaps(c, d)) /* not guaranteed to be identical */
{
flint_printf("FAIL (squaring)\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
abort();
}
arb_poly_mullow_block(a, a, a, trunc, rbits3);
if (!arb_poly_equal(d, a))
{
flint_printf("FAIL (aliasing, squaring)\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("d = "); arb_poly_printd(d, 15); flint_printf("\n\n");
abort();
}
//.........这里部分代码省略.........
示例5: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("evaluate_vec_fast....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong i, n, qbits1, qbits2, rbits1, rbits2, rbits3;
fmpq_poly_t F;
fmpq * X, * Y;
arb_poly_t f;
arb_ptr x, y;
qbits1 = 2 + n_randint(state, 100);
qbits2 = 2 + n_randint(state, 100);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
n = n_randint(state, 10);
fmpq_poly_init(F);
X = _fmpq_vec_init(n);
Y = _fmpq_vec_init(n);
arb_poly_init(f);
x = _arb_vec_init(n);
y = _arb_vec_init(n);
fmpq_poly_randtest(F, state, 1 + n_randint(state, 20), qbits1);
for (i = 0; i < n; i++)
fmpq_randtest(X + i, state, qbits2);
for (i = 0; i < n; i++)
fmpq_poly_evaluate_fmpq(Y + i, F, X + i);
arb_poly_set_fmpq_poly(f, F, rbits1);
for (i = 0; i < n; i++)
arb_set_fmpq(x + i, X + i, rbits2);
arb_poly_evaluate_vec_fast(y, f, x, n, rbits3);
for (i = 0; i < n; i++)
{
if (!arb_contains_fmpq(y + i, Y + i))
{
flint_printf("FAIL (%wd of %wd)\n\n", i, n);
flint_printf("F = "); fmpq_poly_print(F); flint_printf("\n\n");
flint_printf("X = "); fmpq_print(X + i); flint_printf("\n\n");
flint_printf("Y = "); fmpq_print(Y + i); flint_printf("\n\n");
flint_printf("f = "); arb_poly_printd(f, 15); flint_printf("\n\n");
flint_printf("x = "); arb_printd(x + i, 15); flint_printf("\n\n");
flint_printf("y = "); arb_printd(y + i, 15); flint_printf("\n\n");
abort();
}
}
fmpq_poly_clear(F);
_fmpq_vec_clear(X, n);
_fmpq_vec_clear(Y, n);
arb_poly_clear(f);
_arb_vec_clear(x, n);
_arb_vec_clear(y, n);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}示例6: main
int main()
{
long iter;
flint_rand_t state;
printf("log_series....");
fflush(stdout);
flint_randinit(state);
/* compare with fmpq_poly */
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A, B;
acb_poly_t a, b;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
fmpq_poly_init(B);
acb_poly_init(a);
acb_poly_init(b);
fmpq_poly_randtest_not_zero(A, state, m, qbits);
fmpq_poly_set_coeff_ui(A, 0, 1UL);
fmpq_poly_log_series(B, A, n);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_randtest(b, state, 1 + n_randint(state, 20), rbits1, 5);
acb_poly_log_series(b, a, n, rbits2);
if (!acb_poly_contains_fmpq_poly(b, B))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("a = "); acb_poly_printd(a, 15); printf("\n\n");
printf("b = "); acb_poly_printd(b, 15); printf("\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
acb_poly_clear(a);
acb_poly_clear(b);
}
/* test aliasing */
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A;
acb_poly_t a, b;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
acb_poly_init(a);
acb_poly_init(b);
do {
fmpq_poly_randtest_not_zero(A, state, m, qbits);
} while (fmpz_sgn(A->coeffs + 0) <= 0);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_log_series(b, a, n, rbits2);
acb_poly_log_series(a, a, n, rbits2);
if (!acb_poly_equal(a, b))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); acb_poly_printd(a, 15); printf("\n\n");
printf("b = "); acb_poly_printd(b, 15); printf("\n\n");
abort();
}
fmpq_poly_clear(A);
//.........这里部分代码省略.........
示例7: main
int main()
{
long iter;
flint_rand_t state;
printf("compose_series_brent_kung....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 3000; iter++)
{
long qbits1, qbits2, rbits1, rbits2, rbits3, n;
fmpq_poly_t A, B, C;
fmpcb_poly_t a, b, c, d;
qbits1 = 2 + n_randint(state, 200);
qbits2 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
n = 2 + n_randint(state, 25);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(C);
fmpcb_poly_init(a);
fmpcb_poly_init(b);
fmpcb_poly_init(c);
fmpcb_poly_init(d);
fmpq_poly_randtest(A, state, 1 + n_randint(state, 25), qbits1);
fmpq_poly_randtest(B, state, 1 + n_randint(state, 25), qbits2);
fmpq_poly_set_coeff_ui(B, 0, 0);
fmpq_poly_compose_series(C, A, B, n);
fmpcb_poly_set_fmpq_poly(a, A, rbits1);
fmpcb_poly_set_fmpq_poly(b, B, rbits2);
fmpcb_poly_compose_series_brent_kung(c, a, b, n, rbits3);
if (!fmpcb_poly_contains_fmpq_poly(c, C))
{
printf("FAIL\n\n");
printf("n = %ld, bits3 = %ld\n", n, rbits3);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("C = "); fmpq_poly_print(C); printf("\n\n");
printf("a = "); fmpcb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmpcb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmpcb_poly_printd(c, 15); printf("\n\n");
abort();
}
fmpcb_poly_set(d, a);
fmpcb_poly_compose_series_brent_kung(d, d, b, n, rbits3);
if (!fmpcb_poly_equal(d, c))
{
printf("FAIL (aliasing 1)\n\n");
abort();
}
fmpcb_poly_set(d, b);
fmpcb_poly_compose_series_brent_kung(d, a, d, n, rbits3);
if (!fmpcb_poly_equal(d, c))
{
printf("FAIL (aliasing 2)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(C);
fmpcb_poly_clear(a);
fmpcb_poly_clear(b);
fmpcb_poly_clear(c);
fmpcb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}示例8: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("sqrt_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 5000; iter++)
{
slong m, n, qbits, rbits1, rbits2;
fmpq_poly_t A;
acb_poly_t a, b, c;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 30);
n = 1 + n_randint(state, 30);
fmpq_poly_init(A);
acb_poly_init(a);
acb_poly_init(b);
acb_poly_init(c);
fmpq_poly_randtest_not_zero(A, state, m, qbits);
acb_poly_set_fmpq_poly(a, A, rbits1);
acb_poly_sqrt_series(b, a, n, rbits2);
/* Check sqrt(a)^2 = a */
acb_poly_mullow(c, b, b, n, rbits2);
fmpq_poly_truncate(A, n);
if (!acb_poly_contains_fmpq_poly(c, A))
{
flint_printf("FAIL\n\n");
flint_printf("bits2 = %wd\n", rbits2);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("a = "); acb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); acb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); acb_poly_printd(c, 15); flint_printf("\n\n");
abort();
}
acb_poly_sqrt_series(a, a, n, rbits2);
if (!acb_poly_equal(a, b))
{
flint_printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
acb_poly_clear(a);
acb_poly_clear(b);
acb_poly_clear(c);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}示例9: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("acos_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000 * arb_test_multiplier(); iter++)
{
slong m, n, qbits, rbits1, rbits2;
fmpq_poly_t A;
arb_poly_t a, b, c, d;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 30);
n = 1 + n_randint(state, 30);
fmpq_poly_init(A);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(c);
arb_poly_init(d);
fmpq_poly_randtest(A, state, m, qbits);
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_randtest(b, state, 1 + n_randint(state, 30), rbits1, 5);
arb_poly_acos_series(b, a, n, rbits2);
/* Check cos(acos(x)) = x */
arb_poly_sin_cos_series_basecase(d, c, b, n, rbits2, 0);
fmpq_poly_truncate(A, n);
if (!arb_poly_contains_fmpq_poly(c, A))
{
flint_printf("FAIL\n\n");
flint_printf("bits2 = %wd\n", rbits2);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
flint_printf("d = "); arb_poly_printd(d, 15); flint_printf("\n\n");
abort();
}
arb_poly_acos_series(a, a, n, rbits2);
if (!arb_poly_equal(a, b))
{
flint_printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
arb_poly_clear(a);
arb_poly_clear(b);
arb_poly_clear(c);
arb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}示例10: main
int main()
{
long iter;
flint_rand_t state;
printf("inv_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A, B;
fmprb_poly_t a, b;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmprb_poly_init(a);
fmprb_poly_init(b);
do {
fmpq_poly_randtest_not_zero(A, state, m, qbits);
} while (A->coeffs[0] == 0);
fmprb_poly_randtest(b, state, 1 + n_randint(state, 20), rbits1, 5);
fmpq_poly_inv_series(B, A, n);
fmprb_poly_set_fmpq_poly(a, A, rbits1);
fmprb_poly_inv_series(b, a, n, rbits2);
if (!fmprb_poly_contains_fmpq_poly(b, B))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
abort();
}
fmprb_poly_inv_series(a, a, n, rbits2);
if (!fmprb_poly_equal(a, b))
{
printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmprb_poly_clear(a);
fmprb_poly_clear(b);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}示例11: main
int main()
{
slong iter;
flint_rand_t state;
flint_printf("atan_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
slong m, n, qbits, rbits1, rbits2;
fmpq_poly_t A;
arb_poly_t a, b, c, d;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 30);
n = 1 + n_randint(state, 30);
fmpq_poly_init(A);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(c);
arb_poly_init(d);
fmpq_poly_randtest(A, state, m, qbits);
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_randtest(b, state, 1 + n_randint(state, 30), rbits1, 5);
arb_poly_atan_series(b, a, n, rbits2);
/* Check 2 atan(x) = atan(2x/(1-x^2)) + C */
arb_poly_mullow(c, a, a, n, rbits2);
arb_poly_one(d);
arb_poly_sub(c, d, c, rbits2);
arb_poly_add(d, a, a, rbits2);
if (arb_poly_length(c) != 0)
{
arb_poly_div_series(c, d, c, n, rbits2);
arb_poly_atan_series(c, c, n, rbits2);
arb_poly_add(d, b, b, rbits2);
/* TODO: also check the first coefficient */
arb_poly_set_coeff_si(c, 0, 0);
arb_poly_set_coeff_si(d, 0, 0);
if (!arb_poly_overlaps(c, d))
{
flint_printf("FAIL\n\n");
flint_printf("bits2 = %wd\n", rbits2);
flint_printf("A = "); fmpq_poly_print(A); flint_printf("\n\n");
flint_printf("a = "); arb_poly_printd(a, 15); flint_printf("\n\n");
flint_printf("b = "); arb_poly_printd(b, 15); flint_printf("\n\n");
flint_printf("c = "); arb_poly_printd(c, 15); flint_printf("\n\n");
flint_printf("d = "); arb_poly_printd(d, 15); flint_printf("\n\n");
abort();
}
}
arb_poly_atan_series(a, a, n, rbits2);
if (!arb_poly_equal(a, b))
{
flint_printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
arb_poly_clear(a);
arb_poly_clear(b);
arb_poly_clear(c);
arb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
flint_printf("PASS\n");
return EXIT_SUCCESS;
}示例12: main
int main()
{
long iter;
flint_rand_t state;
printf("lgamma_series....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 1000; iter++)
{
long m, n1, n2, qbits, rbits1, rbits2, rbits3;
fmpq_poly_t A;
fmprb_poly_t a, b, c, d;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 400);
rbits2 = 2 + n_randint(state, 400);
rbits3 = 2 + n_randint(state, 400);
m = 1 + n_randint(state, 30);
n1 = 1 + n_randint(state, 30);
n2 = 1 + n_randint(state, 30);
fmpq_poly_init(A);
fmprb_poly_init(a);
fmprb_poly_init(b);
fmprb_poly_init(c);
fmprb_poly_init(d);
fmpq_poly_randtest_not_zero(A, state, m, qbits);
fmpz_abs(A->coeffs, A->coeffs);
fmprb_poly_set_fmpq_poly(a, A, rbits1);
fmprb_poly_lgamma_series(b, a, n1, rbits2);
fmprb_poly_lgamma_series(c, a, n2, rbits3);
fmprb_poly_set(d, b);
fmprb_poly_truncate(d, FLINT_MIN(n1, n2));
fmprb_poly_truncate(c, FLINT_MIN(n1, n2));
if (!fmprb_poly_overlaps(c, d))
{
printf("FAIL\n\n");
printf("n1 = %ld, n2 = %ld, bits2 = %ld, bits3 = %ld\n", n1, n2, rbits2, rbits3);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");
abort();
}
/* check loggamma(a) + log(a) = loggamma(a+1) */
fmprb_poly_log_series(c, a, n1, rbits2);
fmprb_poly_add(c, b, c, rbits2);
fmprb_poly_set(d, a);
fmprb_add_ui(d->coeffs, d->coeffs, 1, rbits2);
fmprb_poly_lgamma_series(d, d, n1, rbits2);
if (!fmprb_poly_overlaps(c, d))
{
printf("FAIL (functional equation)\n\n");
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");
printf("d = "); fmprb_poly_printd(d, 15); printf("\n\n");
abort();
}
fmprb_poly_lgamma_series(a, a, n1, rbits2);
if (!fmprb_poly_overlaps(a, b))
{
printf("FAIL (aliasing)\n\n");
abort();
}
fmpq_poly_clear(A);
fmprb_poly_clear(a);
fmprb_poly_clear(b);
fmprb_poly_clear(c);
fmprb_poly_clear(d);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}示例13: main
int
main(void)
{
int i, result;
FLINT_TEST_INIT(state);
flint_printf("compose_series_brent_kung....");
fflush(stdout);
/* Check aliasing of the first argument */
for (i = 0; i < 10 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
fmpq_poly_compose_series_brent_kung(g, g, h, n);
result = (fmpq_poly_equal(f, g));
if (!result)
{
flint_printf("FAIL (aliasing 1):\n");
fmpq_poly_print(f), flint_printf("\n\n");
fmpq_poly_print(g), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
}
/* Check aliasing of the second argument */
for (i = 0; i < 10 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
fmpq_poly_compose_series_brent_kung(h, g, h, n);
result = (fmpq_poly_equal(f, h));
if (!result)
{
flint_printf("FAIL (aliasing 2):\n");
fmpq_poly_print(f), flint_printf("\n\n");
fmpq_poly_print(h), flint_printf("\n\n");
abort();
}
fmpq_poly_clear(f);
fmpq_poly_clear(g);
fmpq_poly_clear(h);
}
/* Compare with compose */
for (i = 0; i < 20 * flint_test_multiplier(); i++)
{
fmpq_poly_t f, g, h, s, t;
slong n;
fmpq_poly_init(f);
fmpq_poly_init(g);
fmpq_poly_init(h);
fmpq_poly_init(s);
fmpq_poly_init(t);
fmpq_poly_randtest(g, state, n_randint(state, 40), 80);
fmpq_poly_randtest(h, state, n_randint(state, 20), 50);
fmpq_poly_set_coeff_ui(h, 0, 0);
n = n_randint(state, 20);
fmpq_poly_compose(s, g, h);
fmpq_poly_truncate(s, n);
fmpq_poly_compose_series_brent_kung(f, g, h, n);
result = (fmpq_poly_equal(f, s));
if (!result)
{
flint_printf("FAIL (comparison):\n");
flint_printf("n = %wd\n", n);
flint_printf("g = "), fmpq_poly_print(g), flint_printf("\n\n");
flint_printf("h = "), fmpq_poly_print(h), flint_printf("\n\n");
//.........这里部分代码省略.........
示例14: main
int main()
{
long iter;
flint_rand_t state;
printf("divrem....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 100000; iter++)
{
long m, n, qbits1, qbits2, rbits1, rbits2, rbits3;
fmpq_poly_t A, B, Q, R;
arb_poly_t a, b, q, r;
qbits1 = 2 + n_randint(state, 200);
qbits2 = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
rbits3 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 20);
n = 1 + n_randint(state, 20);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmpq_poly_init(Q);
fmpq_poly_init(R);
arb_poly_init(a);
arb_poly_init(b);
arb_poly_init(q);
arb_poly_init(r);
fmpq_poly_randtest(A, state, m, qbits1);
fmpq_poly_randtest_not_zero(B, state, n, qbits2);
fmpq_poly_divrem(Q, R, A, B);
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_set_fmpq_poly(b, B, rbits2);
arb_poly_divrem(q, r, a, b, rbits3);
if (!arb_poly_contains_fmpq_poly(q, Q) ||
!arb_poly_contains_fmpq_poly(r, R))
{
printf("FAIL\n\n");
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("B = "); fmpq_poly_print(B); printf("\n\n");
printf("Q = "); fmpq_poly_print(Q); printf("\n\n");
printf("R = "); fmpq_poly_print(R); printf("\n\n");
printf("a = "); arb_poly_printd(a, 15); printf("\n\n");
printf("b = "); arb_poly_printd(b, 15); printf("\n\n");
printf("q = "); arb_poly_printd(q, 15); printf("\n\n");
printf("r = "); arb_poly_printd(r, 15); printf("\n\n");
abort();
}
arb_poly_divrem(a, r, a, b, rbits3);
if (!arb_poly_equal(a, q))
{
printf("FAIL (aliasing q, a)\n\n");
}
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_divrem(b, r, a, b, rbits3);
if (!arb_poly_equal(b, q))
{
printf("FAIL (aliasing q, b)\n\n");
abort();
}
arb_poly_set_fmpq_poly(b, B, rbits2);
arb_poly_divrem(q, a, a, b, rbits3);
if (!arb_poly_equal(a, r))
{
printf("FAIL (aliasing r, a)\n\n");
abort();
}
arb_poly_set_fmpq_poly(a, A, rbits1);
arb_poly_divrem(q, b, a, b, rbits3);
if (!arb_poly_equal(b, r))
{
printf("FAIL (aliasing r, b)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmpq_poly_clear(Q);
fmpq_poly_clear(R);
arb_poly_clear(a);
arb_poly_clear(b);
//.........这里部分代码省略.........
示例15: main
int main()
{
long iter;
flint_rand_t state;
printf("sin_cos_series_tangent....");
fflush(stdout);
flint_randinit(state);
for (iter = 0; iter < 10000; iter++)
{
long m, n, qbits, rbits1, rbits2;
fmpq_poly_t A, B;
fmprb_poly_t a, b, c, d, e;
qbits = 2 + n_randint(state, 200);
rbits1 = 2 + n_randint(state, 200);
rbits2 = 2 + n_randint(state, 200);
m = 1 + n_randint(state, 30);
n = 1 + n_randint(state, 30);
fmpq_poly_init(A);
fmpq_poly_init(B);
fmprb_poly_init(a);
fmprb_poly_init(b);
fmprb_poly_init(c);
fmprb_poly_init(d);
fmprb_poly_init(e);
fmpq_poly_randtest(A, state, m, qbits);
fmprb_poly_set_fmpq_poly(a, A, rbits1);
fmprb_poly_sin_cos_series_tangent(b, c, a, n, rbits2);
/* Check sin(x)^2 + cos(x)^2 = 1 */
fmprb_poly_mullow(d, b, b, n, rbits2);
fmprb_poly_mullow(e, c, c, n, rbits2);
fmprb_poly_add(d, d, e, rbits2);
fmpq_poly_one(B);
if (!fmprb_poly_contains_fmpq_poly(d, B))
{
printf("FAIL\n\n");
printf("bits2 = %ld\n", rbits2);
printf("A = "); fmpq_poly_print(A); printf("\n\n");
printf("a = "); fmprb_poly_printd(a, 15); printf("\n\n");
printf("b = "); fmprb_poly_printd(b, 15); printf("\n\n");
printf("c = "); fmprb_poly_printd(c, 15); printf("\n\n");
printf("d = "); fmprb_poly_printd(d, 15); printf("\n\n");
abort();
}
fmprb_poly_set(d, a);
fmprb_poly_sin_cos_series_tangent(d, c, d, n, rbits2);
if (!fmprb_poly_equal(b, d))
{
printf("FAIL (aliasing 1)\n\n");
abort();
}
fmprb_poly_set(d, a);
fmprb_poly_sin_cos_series_tangent(b, d, d, n, rbits2);
if (!fmprb_poly_equal(c, d))
{
printf("FAIL (aliasing 2)\n\n");
abort();
}
fmpq_poly_clear(A);
fmpq_poly_clear(B);
fmprb_poly_clear(a);
fmprb_poly_clear(b);
fmprb_poly_clear(c);
fmprb_poly_clear(d);
fmprb_poly_clear(e);
}
flint_randclear(state);
flint_cleanup();
printf("PASS\n");
return EXIT_SUCCESS;
}