Indefinite summation of rational functions with factorization of denominatorsстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 18 июля 2013 г.
Аннотация:A computer algebra algorithm for indefinite summation of rational functions based on complete factorization of denominators is proposed. For a given f, the algorithm finds two rational functions g, r such that f = g(x+1) - g(x) + r and the degree of the denominator of r is minimal. A modification of the algorithm is also proposed that additionally minimizes the degree of the denominator of g. Computational complexity of the algorithms without regard to denominator factorization is shown to be O(m^2), where m is the degree of the denominator of f.
(The paper is a translation of
С.П. Поляков. Неопределенное суммирование рациональных функций с факторизацией знаменателей. Программирование, (4):23–27, 2011.)