Discrete orthogonal polynomials on Gauss-Lobatto Chebyshev nodes

4Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free