Petkovšek's algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Petkovšek's algorithm is a computer algebra algorithm that computes a basis of hypergeometric terms solution of its input linear recurrence equation with polynomial coefficients. Equivalently, it computes a first order right factor of linear difference operators with polynomial coefficients.

References[edit]