论文信息 - Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula

Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula

Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper's algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is increased.

Sergei A. Abramov | M. Petkovssek

[1] Sergei A. Abramov,et al. Solution spaces of H-systems and the Ore-Sato theorem (extended abstract) , 2006, Programming and Computer Software.

[2] S. A. Abramov,et al. Rational solutions of linear differential and difference equations with polynomial coefficients , 1991 .

[3] P. Robba,et al. Rational solutions of linear differential equations , 1989 .

[4] Doron Zeilberger,et al. How to do monthly problems with your computer , 1997 .

[5] R. W. Gosper. Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.

[6] G. Rw. Decision procedure for indefinite hypergeometric summation , 1978 .

[7] Frédéric Chyzak,et al. An extension of Zeilberger's fast algorithm to general holonomic functions , 2000, Discret. Math..

[8] Mark van Hoeij,et al. Integration of solutions of linear functional equations , 1999 .

[9] Markus Schorn,et al. Contributions to Symbolic Summation , 1995 .