Jump to content

Petkovšek's algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by R. J. Mathar (talk | contribs) at 17:02, 31 October 2014 (→References). 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

  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Petkovsek, Marko; Wilf, Herbert; Zeilberger, Doron (1996). "A = B".
  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Template:Cite article


Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Petkovšek%27s_algorithm&oldid=631908467"