Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAECC
2006
Springer

favoriteEmaildiscussreport

135views Algorithms» more AAECC 2006»

Computing Hypergeometric Solutions of Linear Recurrence Equations

13 years 4 months ago

Computing Hypergeometric Solutions of Linear Recurrence Equations

Download www.math.fsu.edu

We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularities and avoid computations in splitting fields. An implementation is available in Maple 9.

Thomas Cluzeau, Mark van Hoeij

Real-time Traffic

AAECC 2006 | Algorithms | Hypergeometric Solutions | Linear Recurrence Relations | Rational Function Coefficients |

claim paper

Related Content

» Finding all Hypergeometric Solutions of Linear Differential Equations

» Special formal series solutions of linear operator equations

» Low Complexity Algorithms for Linear Recurrences

» Hypergeometric series solutions of linear operator equations

» Summation algorithms for Stirling number identities

» Nonliouvillian solutions for second order Linear ODEs

» Liouvillian solutions of irreducible linear difference equations

» On the Diophantine equation axn byn 1

» Secure Linear Algebra Using Linearly Recurrent Sequences

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	AAECC
Authors	Thomas Cluzeau, Mark van Hoeij

Comments (0)