fredrik-johansson

#include "arb.h"
#include "acb_hypgeom.h"

void arb_root_ui_algebraic(arb_t res, const arb_t x, ulong k, slong prec);

void
_arb_pow(arb_t res, const arb_t x, const arb_t y, slong prec)
{
    slong rootlim;

fredrik-johansson

/*
Naive implementation of the trapezoidal rule for integration.
(A non-naive implementation would provide adaptivity, etc.)

WARNING: I have not checked carefully that the code is correct.
Let me know if there is a bug.
*/

#include "arb.h"
#include "arb_poly.h"

fredrik-johansson

#include <string.h>
#include "acb_calc.h"
#include "flint/profiler.h"

/* the integrand */
int
f_pearcey(acb_ptr res, const acb_t z, void * param, slong order, slong prec)
{
    acb_t t, u;

fredrik-johansson

/*
    Copyright (C) 2018 Fredrik Johansson

    This file is part of Arb.

    Arb 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 <http://www.gnu.org/licenses/>.
*/

fredrik-johansson

fredrik-johansson

#include "acb_dirichlet.h"

/* todo: separate prec, eval_prec... */
void
acb_dirichlet_zeta_zero_refine_illinois(arb_t res, const arf_t ra, const arf_t rb, slong prec)
{
    arf_t a, b, fa, fb, c, fc, t;
    acb_t z;
    slong k;
    int asign, bsign, csign;

fredrik-johansson

from flint import fmpq, fmpz
from cmath import *
from mpmath import plot

def dedekind_sum(r, k, _cache={}):
    key = (r << 24) | k
    if key in _cache:
        return _cache[key]
    if fmpz(r).gcd(k) != 1:
        v = None

fredrik-johansson

#include "flint/fmpz_mat.h"
#include "flint/profiler.h"

#define TIMEIT_PRINT1(__var, __timer, __reps) \
    __var = __timer->cpu*0.001/__reps;

#define TIMEIT_REPEAT1(__timer, __reps) \
    do \
    { \
        slong __timeit_k; \

fredrik-johansson

#include "flint/nmod_poly.h"
#include "flint/profiler.h"


/*
   Multiplication/squaring using Kronecker substitution at 2^b and -2^b.
*/
void
_nmod_poly_mul_KS2B(mp_ptr res, mp_srcptr op1, slong n1,
                  mp_srcptr op2, slong n2, nmod_t mod)

fredrik-johansson

/*
Generic Flint-style rings using void pointers + context objects.

todo: write -> print

Principles/goals/benefits:

* Small code size, fast compilation.
* Possible to pack data efficiently (down to 1 byte / element).
* Plain C, similar interface to existing Flint code.