/* Copyright (C) 2012 Sebastian Pancratz This file is part of FLINT. FLINT is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. See . */ /* Benchmarks for the q-adic square root routine. We consider the set-up with p = 17, N = 2^i, i = 0, ..., 19, and compute the Teichmuller lift of C where C = [c{0},...,c{d-1}], where c{i} = (3+i) mod p. */ #include #include #include #include #include #include #include "flint.h" #include "fmpz.h" #include "qadic.h" int main(void) { slong l, len = 20; slong runs[] = { 100, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1 }; slong N[] = { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, WORD(1) << 11, WORD(1) << 12, WORD(1) << 13, WORD(1) << 14, WORD(1) << 15, WORD(1) << 16, WORD(1) << 17, WORD(1) << 18, WORD(1) << 19 }; slong T[20] = {0}; flint_printf("Benchmark for q-adic Teichmuller.\n"); fflush(stdout); for (l = 0; l < len; l++) { FLINT_TEST_INIT(state); slong d = 97, i, n = N[l], r; clock_t c0, c1; long double cputime; fmpz_t p; qadic_ctx_t ctx; qadic_t c, z; fmpz_init_set_ui(p, 17); qadic_ctx_init_conway(ctx, p, d, n, n, "X", PADIC_VAL_UNIT); qadic_init(c); qadic_init(z); padic_poly_fit_length(c, d); _padic_poly_set_length(c, d); c->val = 0; for (i = 0; i < d; i++) { fmpz_set_ui(c->coeffs + i, 3 + i); fmpz_mod(c->coeffs + i, c->coeffs + i, p); } _padic_poly_normalise(c); c0 = clock(); for (r = runs[l]; (r); r--) { qadic_teichmuller(z, c, ctx); qadic_zero(z); } c1 = clock(); cputime = (long double) (c1 - c0) / (long double) CLOCKS_PER_SEC; T[l] = (slong) (cputime * (1000000000 / runs[l])); flint_printf("%2ld, %4XYXYXYXY, %8ld, %wd\n", l, cputime, runs[l], T[l]); qadic_clear(c); qadic_clear(z); fmpz_clear(p); qadic_ctx_clear(ctx); flint_randclear(state); } flint_printf("Output as a list:\n"); for (l = 0; l < len; l++) flint_printf("%wd, ", T[l]); flint_printf("\n"); }