Methods for computing $q$-polynomials
Matematičeskoe modelirovanie, Tome 13 (2001) no. 8, pp. 85-94
Cet article a éte moissonné depuis la source Math-Net.Ru
The methods of computing the classical orthogonal polynomials of a discrete variable (called qpolynomials) are considered. Some difficulties connected with the instability of a calculation in all range of polynomial definition are discussed. These difficulties are illustrated on results of computing the Hahn polynomials. The stability of computational schemes with reference to round-off errors is investigated. Stable method of calculation is proposed. The calculations of Hahn and $q$-Hahn polynomials are carried out with fine accuracy.
@article{MM_2001_13_8_a8,
author = {A. F. Nikiforov and M. V. Skachkov},
title = {Methods for computing $q$-polynomials},
journal = {Matemati\v{c}eskoe modelirovanie},
pages = {85--94},
year = {2001},
volume = {13},
number = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MM_2001_13_8_a8/}
}
A. F. Nikiforov; M. V. Skachkov. Methods for computing $q$-polynomials. Matematičeskoe modelirovanie, Tome 13 (2001) no. 8, pp. 85-94. http://geodesic.mathdoc.fr/item/MM_2001_13_8_a8/