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
Optimal fractional discrete Hardy inequalities on the half-line
František Štampach, Jakub Waclawek
Capacitary-Distance Hardy Inequality
Yiqun Chen, Jie Xiao, Dachun Yang et al.
Microstructure evolution as a game
Michael Ortiz
Optimal differentiability of isotropic positive definite functions on even-dimensional spheres
Yan Ge
Bilinear Bochner--Riesz Means on the Complex Sphere
S. Bagchi, Md N. Molla, J. Singh et al.
Exact-Support Counterexamples to Euclidean-to-Spherical Transfer of Positive Definiteness in Even Dimensions
Wentao Huang, Haizhang Zhang