Tree @HEAD (Download .tar.gz)
- ..
- test
- add.c
- add_series.c
- add_si.c
- agm1_series.c
- atan_series.c
- binomial_transform.c
- binomial_transform_basecase.c
- binomial_transform_convolution.c
- borel_transform.c
- clear.c
- compose.c
- compose_divconquer.c
- compose_horner.c
- compose_series.c
- compose_series_brent_kung.c
- compose_series_horner.c
- contains.c
- contains_fmpq_poly.c
- contains_fmpz_poly.c
- cos_pi_series.c
- cos_series.c
- cosh_series.c
- cot_pi_series.c
- derivative.c
- digamma_series.c
- div_root.c
- div_series.c
- divrem.c
- elliptic_k_series.c
- elliptic_p_series.c
- equal.c
- erf_series.c
- evaluate.c
- evaluate2.c
- evaluate2_horner.c
- evaluate2_rectangular.c
- evaluate_horner.c
- evaluate_rectangular.c
- evaluate_vec_fast.c
- evaluate_vec_iter.c
- exp_pi_i_series.c
- exp_series.c
- exp_series_basecase.c
- find_roots.c
- fit_length.c
- fprintd.c
- gamma_series.c
- get_coeff_acb.c
- get_unique_fmpz_poly.c
- graeffe_transform.c
- init.c
- inlines.c
- integral.c
- interpolate_barycentric.c
- interpolate_fast.c
- interpolate_newton.c
- inv_borel_transform.c
- inv_series.c
- lambertw_series.c
- lgamma_series.c
- log1p_series.c
- log_series.c
- majorant.c
- mul.c
- mullow.c
- mullow_classical.c
- mullow_transpose.c
- mullow_transpose_gauss.c
- normalise.c
- overlaps.c
- polylog_series.c
- pow_acb_series.c
- pow_series.c
- pow_ui.c
- pow_ui_trunc_binexp.c
- powsum_one_series_sieved.c
- powsum_series_naive.c
- powsum_series_naive_threaded.c
- product_roots.c
- randtest.c
- refine_roots_durand_kerner.c
- reverse.c
- revert_series.c
- revert_series_lagrange.c
- revert_series_lagrange_fast.c
- revert_series_newton.c
- rgamma_series.c
- rising_ui_series.c
- root_bound_fujiwara.c
- root_inclusion.c
- rsqrt_series.c
- set.c
- set2_arb_poly.c
- set2_fmpq_poly.c
- set2_fmpz_poly.c
- set_coeff_acb.c
- set_coeff_si.c
- set_fmpz_poly.c
- set_length.c
- set_round.c
- set_si.c
- set_trunc.c
- set_trunc_round.c
- shift_left.c
- shift_right.c
- sin_cos_pi_series.c
- sin_cos_series.c
- sin_cos_series_basecase.c
- sin_cos_series_tangent.c
- sin_pi_series.c
- sin_series.c
- sinc_series.c
- sinh_cosh_series.c
- sinh_cosh_series_basecase.c
- sinh_cosh_series_exponential.c
- sinh_series.c
- sqrt_series.c
- sub.c
- sub_series.c
- tan_series.c
- taylor_shift.c
- taylor_shift_convolution.c
- taylor_shift_divconquer.c
- taylor_shift_horner.c
- tree.c
- validate_real_roots.c
- validate_roots.c
- valuation.c
- zeta_em_bound.c
- zeta_em_choose_param.c
- zeta_em_sum.c
- zeta_em_tail_bsplit.c
- zeta_em_tail_naive.c
- zeta_series.c
pow_ui_trunc_binexp.c @HEAD — raw · history · blame
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 | /* Copyright (C) 2013 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/>. */ #include "acb_poly.h" #define MUL(z, zlen, x, xlen, y, ylen, trunc, prec) \ do { \ slong slen = FLINT_MIN(xlen + ylen - 1, trunc); \ _acb_poly_mullow(z, x, xlen, y, ylen, slen, prec); \ zlen = slen; \ } while (0) void _acb_poly_pow_ui_trunc_binexp(acb_ptr res, acb_srcptr f, slong flen, ulong exp, slong len, slong prec) { acb_ptr v, R, S, T; slong rlen; ulong bit; if (exp <= 1) { if (exp == 0) acb_one(res); else if (exp == 1) _acb_vec_set_round(res, f, len, prec); return; } /* (f * x^r)^m = x^(rm) * f^m */ while (flen > 1 && acb_is_zero(f)) { if (((ulong) len) > exp) { _acb_vec_zero(res, exp); len -= exp; res += exp; } else { _acb_vec_zero(res, len); return; } f++; flen--; } if (exp == 2) { _acb_poly_mullow(res, f, flen, f, flen, len, prec); return; } if (flen == 1) { acb_pow_ui(res, f, exp, prec); return; } v = _acb_vec_init(len); bit = UWORD(1) << (FLINT_BIT_COUNT(exp) - 2); if (n_zerobits(exp) % 2) { R = res; S = v; } else { R = v; S = res; } MUL(R, rlen, f, flen, f, flen, len, prec); if (bit & exp) { MUL(S, rlen, R, rlen, f, flen, len, prec); T = R; R = S; S = T; } while (bit >>= 1) { if (bit & exp) { MUL(S, rlen, R, rlen, R, rlen, len, prec); MUL(R, rlen, S, rlen, f, flen, len, prec); } else { MUL(S, rlen, R, rlen, R, rlen, len, prec); T = R; R = S; S = T; } } _acb_vec_clear(v, len); } void acb_poly_pow_ui_trunc_binexp(acb_poly_t res, const acb_poly_t poly, ulong exp, slong len, slong prec) { slong flen, rlen; flen = poly->length; if (exp == 0 && len != 0) { acb_poly_one(res); } else if (flen == 0 || len == 0) { acb_poly_zero(res); } else { rlen = poly_pow_length(flen, exp, len); if (res != poly) { acb_poly_fit_length(res, rlen); _acb_poly_pow_ui_trunc_binexp(res->coeffs, poly->coeffs, flen, exp, rlen, prec); _acb_poly_set_length(res, rlen); _acb_poly_normalise(res); } else { acb_poly_t t; acb_poly_init2(t, rlen); _acb_poly_pow_ui_trunc_binexp(t->coeffs, poly->coeffs, flen, exp, rlen, prec); _acb_poly_set_length(t, rlen); _acb_poly_normalise(t); acb_poly_swap(res, t); acb_poly_clear(t); } } } |