A discrete and $q$ Asymptotic Iteration Method
Preprint
Abstract
We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear second-order difference or $q$-difference equation subject to a "terminating condition", which is precisely defined. When a difference or $q$-difference equation has a polynomial solution, we show how to find the second solution.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Functions of the second kind for classical polynomialsAdvances in Applied Mathematics, 2014
- Exceptional orthogonal polynomials and the Darboux transformationJournal of Physics A: Mathematical and Theoretical, 2010
- An extension of Bochner’s problem: Exceptional invariant subspacesJournal of Approximation Theory, 2010
- An extended class of orthogonal polynomials defined by a Sturm–Liouville problemJournal of Mathematical Analysis and Applications, 2009
- Criterion for polynomial solutions to a class of linear differential equations of second orderJournal of Physics A: General Physics, 2006
- Classical and Quantum Orthogonal Polynomials in One Variable2005
- Asymptotic iteration method for eigenvalue problemsJournal of Physics A: General Physics, 2003
- On the Zeros of the Hahn-Exton q-Bessel Function and Associated q-Lommel PolynomialsJournal of Mathematical Analysis and Applications, 1994
- The zeros of basic Bessel functions, the functions Jv + ax(x), and associated orthogonal polynomialsJournal of Mathematical Analysis and Applications, 1982
- Über Sturm-Liouvillesche PolynomsystemeMathematische Zeitschrift, 1929