|
General numerical methods
On the structure of solutions to the key Gosper equation in problems of symbolic summation
E. V. Zima Wilfrid Laurier University, Waterloo, Canada
Abstract:
The structure of polynomial solutions to the Gosper’s key equation is analyzed. A method for rapid “extraction” of simple high-degree factors of the solution is given. It is shown that in cases when equation corresponds to a summable non-rational hypergeometric term the Gosper’s algorithm can be accelerated by removing non-essential dependency of its running time on the value of dispersion of its rational certificate.
Key words:
Indefinite hypergeometric summation, accelerated Gosper’s algorithm, factorial polynomials, polynomial normal forms.
Received: 10.05.2022 Revised: 01.06.2022 Accepted: 10.09.2022
Citation:
E. V. Zima, “On the structure of solutions to the key Gosper equation in problems of symbolic summation”, Zh. Vychisl. Mat. Mat. Fiz., 63:1 (2023), 43–50; Comput. Math. Math. Phys., 63:1 (2023), 40–47
Linking options:
https://www.mathnet.ru/eng/zvmmf11494 https://www.mathnet.ru/eng/zvmmf/v63/i1/p43
|
Statistics & downloads: |
Abstract page: | 63 |
|