Fredrik Johansson
|
2fb101501d
|
edits to lcentral.c and to the docs
|
2017-10-31 16:55:49 +01:00 |
|
Fredrik Johansson
|
0639ef7eb5
|
Merge remote-tracking branch 'origin/dft'
|
2017-10-31 16:18:16 +01:00 |
|
Pascal
|
226ed94603
|
order arguments in acb_vec_unit_roots
|
2017-10-30 08:43:01 +01:00 |
|
Pascal
|
c2a7f874dc
|
update acb_dirichlet to use same dft convention
|
2017-10-30 08:43:01 +01:00 |
|
Pascal
|
4376829974
|
change acb_vec_unit_roots interface
separate order from length, and allow negative order
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
c2fb3c8221
|
dft: fix len=0,1 + test
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
4469966ae0
|
typos
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
df5ef78b0f
|
quick documentation of all dft schemes
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
50548c194e
|
doc
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
46cceb956a
|
use dft convol for smooth integers
|
2017-10-30 08:43:00 +01:00 |
|
Pascal
|
04b5dcf3a6
|
document acb_dft
|
2017-10-30 08:43:00 +01:00 |
|
Fredrik Johansson
|
6599fb8528
|
use interval Newton update in legendre_p_ui_root
|
2017-10-25 18:23:53 +02:00 |
|
Fredrik Johansson
|
ac044b4e29
|
slight speedup of Legendre polynomials
|
2017-10-18 15:17:52 +02:00 |
|
Fredrik Johansson
|
0021661d61
|
faster basecase for Legendre polynomials, and a bugfix
|
2017-10-13 22:09:19 +02:00 |
|
Fredrik Johansson
|
61f9e6c489
|
computation of Legendre polynomial roots and Gauss-Legendre quadrature nodes
|
2017-10-11 00:37:57 +02:00 |
|
Fredrik Johansson
|
8947049b77
|
fix and refactor derivative bounds for legendre polynomials
|
2017-10-10 22:34:09 +02:00 |
|
Fredrik Johansson
|
ffaed26841
|
fast and accurate evaluation of ordinary Legendre polynomials (may need further work)
|
2017-10-09 21:29:48 +02:00 |
|
Fredrik Johansson
|
df40b73eee
|
doc fix
|
2017-10-06 20:08:15 +02:00 |
|
Fredrik Johansson
|
44bb510943
|
add mag_bin_uiui
|
2017-10-06 20:07:41 +02:00 |
|
Fredrik Johansson
|
ebfe2189b9
|
asymptotic expansion of Legendre polynomials, initial code
|
2017-10-05 16:29:16 +02:00 |
|
Fredrik Johansson
|
76ffc69264
|
fast computation of central binomial coefficients (todo: improve general bin_uiui)
|
2017-10-04 22:01:40 +02:00 |
|
Pascal
|
cfa3545e2b
|
simplify paths
|
2017-10-02 14:51:23 +02:00 |
|
Fredrik Johansson
|
28c969927c
|
merge and update some acb_dirichlet code
|
2017-09-18 18:20:47 +02:00 |
|
Fredrik Johansson
|
b84da69711
|
fix a typo
|
2017-09-11 04:14:35 +02:00 |
|
Fredrik Johansson
|
d3e395f4f4
|
speed up arb_exp() between 4600 and 19000 bits
|
2017-09-06 16:45:56 +02:00 |
|
Fredrik Johansson
|
fcd3d3bf12
|
sin, cos: replace mpfr with faster custom implementation of the bit-burst algorithm at very high precision
|
2017-09-04 04:43:07 +02:00 |
|
Fredrik Johansson
|
82fff1db45
|
use generic arb version of rs algorithm instead of mpfr to speed up sin/cos at 4600 to 90000 bits; also always use arb's pi for argument reduction
|
2017-09-03 01:30:13 +02:00 |
|
Fredrik Johansson
|
acc552d2ee
|
fix a doc typo
|
2017-08-25 19:17:56 +02:00 |
|
Fredrik Johansson
|
380ce57f6a
|
reduce z' mod tau' in theta functions to support larger arguments with reasonable performance
|
2017-08-25 15:40:57 +02:00 |
|
Fredrik Johansson
|
64fd8a8920
|
speed up acb_elliptic_rj for high precision by using a variable length Taylor expansion
|
2017-08-23 22:51:20 +02:00 |
|
Fredrik Johansson
|
2fb86a0383
|
speed up acb_elliptic_rf for high precision by using a variable length Taylor expansion
|
2017-08-17 23:51:03 +02:00 |
|
Fredrik Johansson
|
757d714ac1
|
speed up arb_agm
|
2017-08-12 15:03:09 +02:00 |
|
Fredrik Johansson
|
46bfe1e976
|
add mag_set_d_lower, mag_sqrt_lower, mag_set_d_2exp_fmpz_lower; some code improvements
|
2017-08-11 11:33:20 +02:00 |
|
Fredrik Johansson
|
683dea6c17
|
agm: use central difference instead of forward difference to reduce precision
|
2017-08-08 23:36:56 +02:00 |
|
Fredrik Johansson
|
6035ee2420
|
add acb_mat_mul_threaded
|
2017-08-01 14:01:05 +02:00 |
|
Fredrik Johansson
|
de4fc234ea
|
update version to 2.11.1
|
2017-07-10 19:23:44 +02:00 |
|
Fredrik Johansson
|
dc6bea8b9c
|
update docs; call this 2.11.0
|
2017-07-09 21:24:49 +02:00 |
|
Fredrik Johansson
|
4fb7e281e1
|
small bugfix for poly_roots example program, and update docs
|
2017-07-09 18:45:02 +02:00 |
|
Fredrik Johansson
|
3be24cc287
|
update citations
|
2017-07-09 18:26:25 +02:00 |
|
Fredrik Johansson
|
7975162629
|
rely on the fmpz_poly_cos_minpoly code from flint (available since 2.5)
|
2017-06-25 11:53:21 +02:00 |
|
Fredrik Johansson
|
f62ce540cf
|
edit docs
|
2017-06-25 11:31:16 +02:00 |
|
Fredrik Johansson
|
472b1768c4
|
small doc fixes
|
2017-06-23 15:17:51 +02:00 |
|
Fredrik Johansson
|
7d0f75f38e
|
add arb_fmpz_poly_complex_roots
|
2017-06-23 15:14:30 +02:00 |
|
Fredrik Johansson
|
84c79a3a10
|
add arb_fmpz_poly module with evaluation, plus a function to construct minimal polynomials of Gaussian periods
|
2017-06-23 13:08:45 +02:00 |
|
Fredrik Johansson
|
bb45bbcbed
|
require flint 2.5
|
2017-06-23 13:08:10 +02:00 |
|
Fredrik Johansson
|
12d6658ae7
|
add arb_poly_product_roots_complex; add test code and slight optimization for arb/acb_poly_product_roots
|
2017-06-21 15:07:40 +02:00 |
|
Fredrik Johansson
|
de0349a885
|
add arb_sinc_pi, acb_sinc_pi
|
2017-06-20 09:44:25 +02:00 |
|
Fredrik Johansson
|
af1f607c32
|
add acb_dirichlet_hurwitz; rearrange internal call sequence to make sure Riemann zeta code is used in all cases when a=1
|
2017-06-19 10:23:44 +02:00 |
|
Fredrik Johansson
|
e08d863d58
|
add acb_expm1
|
2017-06-12 16:40:33 +02:00 |
|
Fredrik Johansson
|
d529f4df86
|
fix two typos in docs
|
2017-04-22 14:03:36 +02:00 |
|