In this paper, we present explicit formulas for discrete orthogonal polynomials over the so-called Gauss-Lobatto Chebyshev points. In particular, this allows us to compute the coefficient in the three-terms recurrence relation and the explicit formulas for the discrete inner product. The paper also contains numerical examples related to the least-squares problems. © 2007 Elsevier Inc. All rights reserved.
Eisinberg, A., & Fedele, G. (2007). Discrete orthogonal polynomials on Gauss-Lobatto Chebyshev nodes. Journal of Approximation Theory, 144(2), 238–246. https://doi.org/10.1016/j.jat.2006.06.003