Skip to content
Journal of Mathematical and Computational Science ISSN 1927-5307 (Print)

Archives › Volume 12 (2022)

J. Math. Comput. Sci. 12 (2022), Article ID 115

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

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

PDF (152.0 KB) https://doi.org/10.28919/jmcs/7226

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.

Published
21 March 2022
Volume
12 (2022)
License
CC BY 3.0

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.

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), 115. https://doi.org/10.28919/jmcs/7226

BibTeX
@article{Mekhalfa2022,
  author  = {Mekhalfa, S. and Ali Khelil, K. and Bouras, M. C.},
  title   = {Application of the discrete classical case to a 1−2 type relation},
  journal = {J. Math. Comput. Sci.},
  volume  = {12},
  year    = {2022},
  pages   = {115},
  doi     = {10.28919/jmcs/7226}
}