Algorithms for classical orthogonal polynomials
Wolfram Koepf, Dieter Schmersau
Abstract
In this article explicit formulas for the recurrence equation pn+1(x) = (An x + Bn) pn(x) - Cn pn-1(x) and the derivative rules sigma(x) p'n(x) = alphan pn+1(x) + betan pn(x) + gamman pn-1(x) and sigma(x) p'n(x) = (alphan-tilde x + betan-tilde) pn(x) + gamman-tilde pn-1(x) respectively which are valid for the orthogonal polynomial solutions pn(x) of the differential equation sigma(x) y''(x) + r(x) y'(x) + lambdan y(x) = 0 of hypergeometric type are developed that depend only on the coefficients sigma(x) and tau(x) which themselves are polynomials w.r.t. x of degree not larger than 2 and 1, respectively. Partial solutions of this problem had beed previously published by Tricomi, and recently by Yáñez, Dehesa and Nikiforov.
Create a lesson
Related papers
Poisson area and non-tangential maximal functions on manifolds with ends and applications
Peng Chen, Ji Li, Lixin Yan
Bounds for Orthogonal Expansion Coefficients via Weighted Primitives
Vladimir Sluchak
One-Sided Hardy--Littlewood Maximal Operators on Variable Lebesgue Spaces Beyond Log-Hölder Continuity
Lucas A. Vallejos
Lecture note on Fourier decoupling theory and its applications
Yudong Liang
Hyperplane Furstenberg Sets in Higher Dimensions
Peiqi Nie
Characterization of the group Fourier transform of Hilbert space Valued functions
Satyajyoti Achar, Md Hasan Ali Biswas, Ramesh Manna