Accepting request 870144 from home:aaronpuchert
- Update to release 2.13.1. Fixes the following bugs: * GC error in idealinv. * qfminim inefficiency (initial bound from non-LLL-reduced matrix). * mfshimura in weight 3/2 => infinite loop * matsolve([1,1,1/2; 1,0,1/2; 2,1,0], [-1;1;-1]) -> SEGV. * qfminim(Mat(1),,,2) -> precision error. * subst(p, v, t_SER) very slow if p contains many variables. * mfsymboleval for trivial path returned 0 instead of a vector of 0s when f has multiple embeddings. * 2^(1 + O(3^4)) -> type error. * Zn_quad_roots(8,0,-1) to compute roots of x^2-1 mod 8 -> [4,[1,3]] (1 or 3 mod 4) instead of the expected [2,[1]] (1 mod 2). * tan(1+10^20*I) -> overflow (same for cotan and psi). * Mod(2,3)^1000000000000000000001 -> Mod(-1,3). * subst(O(y) + x, x, (1 - y + O(y^2))*x + O(x^2)) -> SEGV. * (Mod(0,3) + x) + O(x^2) -> x + O(x^2) [now Mod(1,3)*x + O(x^2)]. * Precision too low for units in mfgaloisprojrep. * Missing GC at the end of RgXn_inv. * (-1)^(1/3) -> -1 instead of exp(log(-1)/3). * mfeisenstein(k, trivial characters mod N > 1) was incorrect. * Missing GC in qfsolve. - More change log for 2.13.0 that's not yet in Factory. OBS-URL: https://build.opensuse.org/request/show/870144 OBS-URL: https://build.opensuse.org/package/show/science/pari?expand=0&rev=48
This commit is contained in:
parent
8bdccafbf1
commit
b893bd44b9
@ -1,3 +0,0 @@
|
||||
version https://git-lfs.github.com/spec/v1
|
||||
oid sha256:c811946de9d2c1ed0e97ff08e80d966f9a0b55848b7688406fab229e3948ba93
|
||||
size 4758091
|
@ -1,16 +0,0 @@
|
||||
-----BEGIN PGP SIGNATURE-----
|
||||
|
||||
iQIzBAABCgAdFiEEQgKOpASi6dgKxFMUjw58K0Ui44cFAl+Ny1AACgkQjw58K0Ui
|
||||
44eJKxAAkz5jkPwpv1gkDe3ZoR6PnFDCQsikQlcrkhSQWpf/hdoPx3k6GRN2c41B
|
||||
4ToehEB1XClPCpLDtSMncSenoGjEcrDdK2h8bYFAXC0/nZuIKlNvSyHRnCY+MqCe
|
||||
6VUV+D3t77sigpJfyZzBIB7Uq1juA9Xgnr1/HDGZGg/pDEYj2c4mINzBkvyELpaN
|
||||
M6YT6n+aeBb7hUO2pOkJplRl8GJv4bLqUG0tYVcECWvxO/dxnSiSAy4d/IIdCeo5
|
||||
1ue6OdQ5L4T3r39FOzPuaFBViqWfwNh2jhf71K6trxhcYfHEBo+VExtag1Xoe3L6
|
||||
LQFfohfkHp0D1DOD70R7F23hXxDDUI4wfrPnBWcWFWxpfEBka8v3I3trvTa+5I/O
|
||||
NlolOWS3LLLOMsnVluueN1n4X0Pa+3/Dlnp8cG78kuSHda/e/ElyT/FauJUtK/p4
|
||||
bvuFojp8WTH9XL80t5tRhBYLlWCL81C7WDGZ9nvju7xWqGNpD+UW8+3YJUhool6/
|
||||
8qD85jI20SIIh5K/VS2zagKd0hPTc7xO1lQ5szghv+S0Z0PXHUkecRx8YeAigvYB
|
||||
h4wEiBhbUQO4PhS2Nzyy9N2kHaEZ4/Jm2R4gk3bKbIH29zvfLsiNm60lVMWN4NDJ
|
||||
mSeLf0/W3nVUt91I/3qb1hvkqMjh6A6S6l6lfrF+3hjDK8Hp+P4=
|
||||
=bmkG
|
||||
-----END PGP SIGNATURE-----
|
3
pari-2.13.1.tar.gz
Normal file
3
pari-2.13.1.tar.gz
Normal file
@ -0,0 +1,3 @@
|
||||
version https://git-lfs.github.com/spec/v1
|
||||
oid sha256:81ecf7d70ccdaae230165cff627c9ce2ec297b8f22f9f40742279d85f86dfcb1
|
||||
size 4760932
|
16
pari-2.13.1.tar.gz.asc
Normal file
16
pari-2.13.1.tar.gz.asc
Normal file
@ -0,0 +1,16 @@
|
||||
-----BEGIN PGP SIGNATURE-----
|
||||
|
||||
iQIzBAABCgAdFiEEQgKOpASi6dgKxFMUjw58K0Ui44cFAmADM90ACgkQjw58K0Ui
|
||||
44emkw//dwJNLGXLr5bB6/5UqltUQy8VLA4SzyJC0gb77C0uQgms5DuDMNgJNrF5
|
||||
WDbaxXWbcIB44ORX17B/y407hUoPvL9LPVtE1J1NxkUln1jjLiFOf9KFbaFfo/SS
|
||||
jcvTZZbN+GWItveq5+vkNY6A4CiPix+IjAQ5tZAHbQlJLxJ3K09VMYtO7ICsIHSd
|
||||
MKiq+pO8kEc4ANIA71I8x1Z7HXVtkfV3lGZ65u+1rDaTaW1821UgbdO+rOBvR81Z
|
||||
it1KYYX4ZTGzA3iM4bqbxJatkSzyZi6WsuSh4EsYWLo/8YBMRefvWvWWyYQ9Kl7J
|
||||
TzkpGDoiri0UoKyYEAsHitPLRgiSUalXOm1EopQfkE5rYJtqUxslu56Ik/saRIzs
|
||||
vc+CrkWsyywZRvue+FKsZpYWiNHYHBDOKm/n9lRRl/dyOBCPj5ouvbOEefJ9wDnw
|
||||
FidqxYeDBbcW4Q4crl2HFweKZtgr15CmBRnpaxGT6KS/TbxgqefkukQ1CAlOe2Xj
|
||||
1QBN7JG9oUexlE2drHVsAxLW2e2kRHThy/5Z/OfaO8caXm+jVXroweXARO8FY4Z5
|
||||
KzLPKbcPW/AUNwpNtnRl9350g0rIhEq7DkomyZmsTDNdZ/I0HA4lif3o9YQa8KPZ
|
||||
Vk78Fc4DAgctw0x69130jDHVPJN8bObh1hWetX9F7d6fcad73Wk=
|
||||
=Foqs
|
||||
-----END PGP SIGNATURE-----
|
159
pari.changes
159
pari.changes
@ -1,10 +1,169 @@
|
||||
-------------------------------------------------------------------
|
||||
Sun Feb 7 21:15:14 UTC 2021 - Aaron Puchert <aaronpuchert@alice-dsl.net>
|
||||
|
||||
- Update to release 2.13.1. Fixes the following bugs:
|
||||
* GC error in idealinv.
|
||||
* qfminim inefficiency (initial bound from non-LLL-reduced matrix).
|
||||
* mfshimura in weight 3/2 => infinite loop
|
||||
* matsolve([1,1,1/2; 1,0,1/2; 2,1,0], [-1;1;-1]) -> SEGV.
|
||||
* qfminim(Mat(1),,,2) -> precision error.
|
||||
* subst(p, v, t_SER) very slow if p contains many variables.
|
||||
* mfsymboleval for trivial path returned 0 instead of a vector
|
||||
of 0s when f has multiple embeddings.
|
||||
* 2^(1 + O(3^4)) -> type error.
|
||||
* Zn_quad_roots(8,0,-1) to compute roots of x^2-1 mod 8 -> [4,[1,3]]
|
||||
(1 or 3 mod 4) instead of the expected [2,[1]] (1 mod 2).
|
||||
* tan(1+10^20*I) -> overflow (same for cotan and psi).
|
||||
* Mod(2,3)^1000000000000000000001 -> Mod(-1,3).
|
||||
* subst(O(y) + x, x, (1 - y + O(y^2))*x + O(x^2)) -> SEGV.
|
||||
* (Mod(0,3) + x) + O(x^2) -> x + O(x^2) [now Mod(1,3)*x + O(x^2)].
|
||||
* Precision too low for units in mfgaloisprojrep.
|
||||
* Missing GC at the end of RgXn_inv.
|
||||
* (-1)^(1/3) -> -1 instead of exp(log(-1)/3).
|
||||
* mfeisenstein(k, trivial characters mod N > 1) was incorrect.
|
||||
* Missing GC in qfsolve.
|
||||
|
||||
-------------------------------------------------------------------
|
||||
Mon Oct 26 15:03:47 UTC 2020 - Jan Engelhardt <jengelh@inai.de>
|
||||
|
||||
- Update to release 2.13.0
|
||||
* New libpari functions: perm_sqr, perm_powu, perm_orderu, quodif.
|
||||
* Added asymptotically fast quadunit.
|
||||
* Faster intnumgaussinit and change default number of points
|
||||
to B/4, suitable when b - a ~ distance to the nearest pole.
|
||||
* In libpari, perm_pow now takes a t_INT exponent, permorder
|
||||
and perm_order return a t_INT.
|
||||
* sizebyte(objects containing t_LIST): would assign size 3 to all lists
|
||||
* permorder returned incorrect results for large orders
|
||||
* cure SIGSEGV on [Map(Mat([0, 0])), [0, 0, 1]]
|
||||
* cure SIGSEGV on zeta(I+2^(-64))
|
||||
* cure infinite loop on p=[4,54];lfunmf(mfinit(p,0), mftraceform(p,0))
|
||||
* printf("%5.2f",M) transposed M
|
||||
* bnfinit instability at low accuracy. E.g., at \p38
|
||||
P=x^7+22*x^6+184*x^5+764*x^4+2020*x^3+3792*x^2+5712*x+4;
|
||||
bnfinit(P,1).no -> 4 times too large
|
||||
* Accuracy problems in bnfisunit after bnfinit(P,1). E.g.,
|
||||
P=x^7-22*x^6+169*x^5-568*x^4+1263*x^3-1506*x^2+2295*x+2;
|
||||
setrand(1); K=bnfinit(P,1); U=bnfunits(K,idealprimedec(K,2));
|
||||
bnfisunit(K,4*(x^2-18*x+85)/x^2*Mod(1,K.pol),U) -> error
|
||||
- Update to release 2.12.1.
|
||||
* New functions in GP: asympnumraw, bnrmap, bnfunits,
|
||||
dirpowerssum, ellpadiclambdamu, eulerianpol, eulerfrac,
|
||||
eulerpol, eulervec, fft, fftinv, halfgcd, lfundual, lfunshift,
|
||||
matreduce, mfisetaquo, mscosets, msfarey, nfsubfieldscm,
|
||||
nfsubfieldsmax, parforeach, parforprimestep, parplothexport,
|
||||
permcycles, polylogmult, rootsof1, zetamultdual.
|
||||
* New libpari functions: absZ_factor_limit_strict,
|
||||
bnf_build_cheapfu, bnf_compactfu, bnf_compactfu_mat,
|
||||
bnf_get_sunits, bnf_has_fu, bnrchar_primitive_raw,
|
||||
bnrconductor_factored, bnrconductor_raw, bnrisprincipalmod,
|
||||
bnr_subgroup_check, checkbnr_i, checkfarey_i,
|
||||
closure_callgen0prec, cmpss, cmpuu, cyc_get_expo, div_content,
|
||||
ellQtwist_bsdperiod, etaquotype, expIPiC, expIPiR, F2m_row,
|
||||
F2Ms_colelim, F2Ms_ker, F2Ms_to_F2m, F2m_to_F2Ms,
|
||||
F2m_transpose, F2v_and_inplace, F2v_hamming,
|
||||
F2v_negimply_inplace, F2v_or_inplace, F2xn_inv, F2xn_red,
|
||||
F2xqX_halfgcd, F2xX_to_F2xC, F2xXV_to_F2xM, factorial_Fl,
|
||||
factorial_Fp, famat_div, famat_idealfactor, famat_nfvalrem,
|
||||
famat_remove_trivial, famatV_factorback, famatV_zv_factorback,
|
||||
ff_parse_Tp, FFX_add, FFX_halfgcd, Flv_factorback, Flx_blocks,
|
||||
Flx_Fl_sub, Flx_is_totally_split, Flxn_expint, Flxq_autpowers,
|
||||
FlxqV_factorback, FlxqX_fromNewton, FlxqX_Newton,
|
||||
FlxqXn_expint, FlxqXn_inv, FlxqXn_mul, FlxqXn_sqr,
|
||||
Flx_translate1_basecase, FlxV_Flv_multieval, FlxX_blocks,
|
||||
FlxX_invLaplace, FlxX_Laplace, FlxXn_red, FlxX_translate1,
|
||||
forqfvec1, FpV_prod, FpXC_to_mod, FpX_divu, FpX_Fp_div,
|
||||
FpX_FpXV_multirem, FpXM_to_mod, FpXn_expint, FpXQXn_expint,
|
||||
FpXV_chinese, FpXY_FpXQ_evaly, FqC_FqV_mul, FqC_to_mod,
|
||||
FqV_factorback, FqXC_to_mod, FqX_expint, FqXM_to_mod,
|
||||
galoismatrixapply, gc_const, gen_sort_shallow, gen_ZpM_Newton,
|
||||
groupelts_conj_set, groupelts_quotient, groupelts_to_group,
|
||||
group_subgroup_is_faithful, halfgcdii, hash_zv,
|
||||
idealfactor_partial, ideallogmod, ideallog_units,
|
||||
ideallog_units0, idealpseudominvec, Idealstarmod, init_Flxq,
|
||||
is_qfb_t, Kronecker_to_ZXQX, lfunquadneg, minim_zm,
|
||||
mseval2_ooQ, mspadic_parse_chi, mspadic_unit_eigenvalue,
|
||||
nf_cxlog, nf_cxlog_normalize, nfhyperellpadicfrobenius,
|
||||
nflogembed, nfsign_fu, nfsign_tu, nfV_cxlog, nfX_disc,
|
||||
nfX_resultant, pariplot, pari_realloc_ip, pow2Pis, pow2Pis,
|
||||
powPis, powPis, QabM_tracerel, Qab_tracerel, QabV_tracerel,
|
||||
Qdivis, Qdiviu, Q_lval, Q_lvalrem, QM_gauss_i, QM_image,
|
||||
QM_image_shallow, QM_ImQ, QM_ImQ_all, QM_ImZ, QM_ImZ_all,
|
||||
QM_sqr, quotient_groupelts, QXQ_to_mod_shallow, QXQX_gcd,
|
||||
QXQX_mul, QXQX_powers, QXQX_QXQ_mul, QXQX_sqr, radicalu,
|
||||
random_zv, rfracrecip, RgM_ZM_mul, RgV_type, RgV_type2,
|
||||
RgX_halfgcd, RgXn_expint, RgXV_to_FlxV,
|
||||
rnf_get_ramified_primes, SL2_inv_shallow, sumdivmultexpr,
|
||||
sunits_makecoprime, uis2psp, uispsp, upowers, vec_equiv,
|
||||
vecfactorsquarefreeu_coprime, vec_reduce, vecsmall_is1to1,
|
||||
vecsmall_isconst, vecvecsmall_sort_inplace,
|
||||
vecvecsmall_sort_shallow, Vgaeasytheta, ZC_u_divexact,
|
||||
zlx_translate1, zlxX_translate1, ZMrow_equal0, ZpM_invlift,
|
||||
ZpX_primedec, ZV_lcm, ZV_snf_gcd, zv_sumpart, ZX_compositum,
|
||||
zx_lval, ZXQ_minpoly, ZXQ_powers, ZXQX_gcd, ZXQX_ZXQ_mul,
|
||||
ZX_realroots_irred, ZX_sturm_irred, ZXX_evalx0, ZXX_Q_mul,
|
||||
zx_z_divexact,
|
||||
* Allow nfinit([T, basis, ramified primes]).
|
||||
* Allow nf.p, rnf.p [rational ramified primes].
|
||||
* Add flag bit to ZM_snfall_i.
|
||||
* Allow real t_QUAD in floor, ceil, divrem, %, \, \/.
|
||||
* Parallel support for lfuninit.
|
||||
* Direct formulas for quadratic Dirichlet L-functions at integers.
|
||||
* lfuncreate: support for closures of arity 0.
|
||||
* Compact representation of units in bnf (bnfinit(pol,1)) and of
|
||||
principal ideal generators (bnfisprincipal(bnf,id,4)).
|
||||
* lfuncreate(znstar or bnr,): allow a vector of characters =>
|
||||
vector-valued L-function.
|
||||
* Holes in multi-assignement: [a,,c]=[1,2,3].
|
||||
* nfisincl: new flag: return a single embedding.
|
||||
* qflll(x,3) in place reduction: return x * qflll(x) (faster).
|
||||
* galoisinit: support for group (3x3):4 (GAP4(36,9)).
|
||||
* Removed obsolete function rootsof1_kannan: use nfrootsof1.
|
||||
* Removed obsolete function checkbnrgen: use bnr_get_gen.
|
||||
* For additional changes, see the included changelog.
|
||||
- Update to release 2.12.0.
|
||||
* New functions in GP: airy, arity, bnrclassfield, derivn,
|
||||
dirpowers, ellE, ellK, export, exportall, ffmaprel,
|
||||
getlocalbitprec, getlocalprec, hypergeom, idealdown,
|
||||
idealismaximal, mfgaloisprojrep, nfdiscfactors, pollaguerre,
|
||||
polteichmuller, strjoin, strsplit, strtime, unexport,
|
||||
unexportall.
|
||||
* New libpari functions: bid_get_fact2, closure_derivn,
|
||||
constzeta, divisorsu_fact_factored, divisorsu_moebius,
|
||||
F2xqX_disc, F2xqX_resultant, F2x_recip, F2x_Teichmuller,
|
||||
FF_preimagerel, FF_var, FFX_disc, FFX_extgcd, FFX_gcd,
|
||||
FFXQ_minpoly, FFX_resultant, Flx_fromNewton, Flx_integ,
|
||||
Flx_invLaplace, Flx_Laplace, Flx_Newton, Flxn_exp, Flxn_red,
|
||||
Flxn_sqr, FlxqX_disc, FlxqX_resultant, Flx_Teichmuller,
|
||||
Fp_divu, FpXC_FpXQ_eval, FpXQX_disc, FpXQX_resultant, gc_bool,
|
||||
gc_double, gc_int, gc_long, gc_NULL, gc_ulong,
|
||||
gluncloneNULL_deep, guncloneNULL, hash_init, hash_init_ulong,
|
||||
has_str_len, identity_zv, identity_ZV, maxprimeN, mpsinhcosh,
|
||||
mulu_interval_step, nfX_to_monic, nonsquare_Fl,
|
||||
pari_get_histrtime, polint_i, polintspec, pollegendre_reduced,
|
||||
psi1series, qfiseven, rfrac_deflate, rfrac_deflate_max,
|
||||
rfrac_deflate_order, RgV_is_arithprog, RgV_isin_i, set_avma,
|
||||
setunion_i, walltimer_delay, walltimer_start, ZpXQX_liftroots,
|
||||
zv_cyc_minimal, zv_cyc_minimize, ZXQ_powu.
|
||||
* qfbsolve(Q,n) now supports arbitrary integer n.
|
||||
* limitnum/asympnum: allow closures of the form
|
||||
N->[u(1),...,u(N)], which allows to handle efficiently sums,
|
||||
recursions, continued fractions, etc.
|
||||
* Optional flag to pollegendre and polhermite.
|
||||
* Allow subst(e, x, vector v) for vector(subst(e, x, v[i])).
|
||||
* Optional v argument to nfmodprinit.
|
||||
* Support call by reference in GP function: f(~L,x)=listput(~L,x+1).
|
||||
* Generic fast linear algebra using CUP decomposition.
|
||||
* Implement lfunmfspec in odd weight.
|
||||
* Support for rational model in ellratpoints and hyperellratpoints.
|
||||
* Fast algorithm for zeta([a + b*n | n<-[0..N]]).
|
||||
* ellheight(E) now returns the Faltings height of E.
|
||||
* lfun now allows non-integral weights.
|
||||
* example/parigp.sty to re-enable PARI's \pmatrix with amsmath.
|
||||
* Removed member functions .futu and .tufu (deprecated since 2.2).
|
||||
* Removed inferior hash function hash_str2: use hash_str.
|
||||
* Removed obsolete binary flag '2' in matsnf (make it a no no-op).
|
||||
* For additional changes, see the included changelog.
|
||||
|
||||
-------------------------------------------------------------------
|
||||
Sat Jun 6 23:59:38 UTC 2020 - Jan Engelhardt <jengelh@inai.de>
|
||||
|
@ -1,7 +1,7 @@
|
||||
#
|
||||
# spec file for package pari
|
||||
#
|
||||
# Copyright (c) 2020 SUSE LLC
|
||||
# Copyright (c) 2021 SUSE LLC
|
||||
#
|
||||
# All modifications and additions to the file contributed by third parties
|
||||
# remain the property of their copyright owners, unless otherwise agreed
|
||||
@ -23,7 +23,7 @@
|
||||
Name: pari
|
||||
%define sover 7
|
||||
%define lname libpari-gmp-tls%sover
|
||||
Version: 2.13.0
|
||||
Version: 2.13.1
|
||||
Release: 0
|
||||
Summary: Computer Algebra System for computations in Number Theory
|
||||
License: GPL-2.0-only
|
||||
|
Loading…
Reference in New Issue
Block a user