Application of the discrete classical case to a 1−2 type relation

S. Mekhalfa, K. Ali Khelil, M. C. Bouras

Abstract


In this paper, we present a simple approach in order to build up recursively the connection coefficients between a sequence of polynomials {Qn}n≥0 and an orthogonal polynomials sequence {Pn}n≥0 when
Pn(x) = Qn(x) +rnQn−1(x), n≥0.
This yields the relation between the parameters of the corresponding recurrence relations. Some special cases are developed. More specifically, assuming that {Pn}n≥0 is a discrete classical orthogonal polynomials sequence.

Full Text: PDF

Published: 2022-03-21

How to Cite this Article:

S. Mekhalfa, K. Ali Khelil, M. C. Bouras, Application of the discrete classical case to a 1−2 type relation, J. Math. Comput. Sci., 12 (2022), Article ID 115

Copyright © 2022 S. Mekhalfa, K. Ali Khelil, M. C. Bouras. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS