Petkovšek's algorithm: Difference between revisions

Revision as of 01:14, 16 May 2013

Revision as of 01:39, 16 May 2013

Line 1:

{{Userspace draft|source=ArticleWizard|date=May 2013}}

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

== References ==

* Marko Petkovsek, Herbert Wilf and Doron Zeilberger, [http://www.cis.upenn.edu/~wilf/AeqB.html The book "A = B"]

{{combin-stub}}

== External links ==

[[Category:Combinatorics]]

* [http://www.cis.upenn.edu/~wilf/AeqB.html The book "A = B"], this book is freely downloadable from the internet.

<!--- Categories --->

[[Category:Articles created via the Article Wizard]]

== Request review at [[WP:AFC]] ==

<!-- This will add a notice to the bottom of the page and won't blank it! The new template which says that your draft is waiting for a review will appear at the bottom; simply ignore the old (grey) drafted templates and the old (red) decline templates. A bot will update your article submission. Until then, please don't change anything in this text box and press "Save page". -->

{{AFC submission|||ts=20130514203543|u=Bsalvy|ns=2}}