Solving difference equations in finite terms
Journal of Symbolic Computation
Rational solutions of matrix difference equations: the problem of equivalence and factorization
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Computing Hypergeometric Solutions of Linear Recurrence Equations
Applicable Algebra in Engineering, Communication and Computing
Liouvillian solutions of irreducible linear difference equations
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences
Journal of Symbolic Computation
Solving linear recurrence equations
ACM Communications in Computer Algebra
Closed form solutions of linear difference equations in terms of symmetric products
ACM Communications in Computer Algebra
Termination conditions for positivity proving procedures
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Closed form solutions of linear difference equations in terms of symmetric products
Journal of Symbolic Computation
Hi-index | 0.00 |
The goal in this paper is to find closed form solutions for linear recurrence equations, by transforming an input equation L to an equation Ls with known solutions. The main problem is how to find a solved equation Ls to which L can be reduced. We solve this problem by computing local data at singularities, data that remains invariant under the transformations used.