Jump to content

Petkovšek's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by D.Lazard (talk | contribs) at 01:39, 16 May 2013 (Tagging as stub + category). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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