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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Журнал вычислительной математики и математической физики
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
