Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Zima, Eugene"'
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and for describi
Externí odkaz:
http://arxiv.org/abs/2002.00124
We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the important feature that the computation of a telescoper is independent of its
Externí odkaz:
http://arxiv.org/abs/1909.06898
Publikováno v:
In Journal of Symbolic Computation March-April 2022 109:57-87
Publikováno v:
In Journal of Symbolic Computation November-December 2021 107:122-144
The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \log^2 d)$ and space complexity of $O(d \log d)$ or $O(d)$. Following work from Cheng,
Externí odkaz:
http://arxiv.org/abs/cs/0701151
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Zima, Eugene V.
Publikováno v:
ACM Communications in Computer Algebra; February 2019, Vol. 52 Issue: 3 p96-99, 4p
Autor:
Cheng, Howard, Zima, Eugene
Publikováno v:
Proceedings of the 2000 International Symposium: Symbolic & Algebraic Computation; 7/ 1/2000, p54-61, 8p