Discrete orthogonal polynomials on Gauss--Lobatto Chebyshev nodes

Authors:
A. Eisinberg;G. Fedele
Affiliations:
Dip. Elettronica Informatica e Sistemistica, Università degli Studi della Calabria, 87036 Rende (Cs), Italy;Dip. Elettronica Informatica e Sistemistica, Università degli Studi della Calabria, 87036 Rende (Cs), Italy
Venue:
Journal of Approximation Theory
Year:
2007

Citing 1
Cited 2

Mathematica: a system for doing mathematics by computer (2nd ed.)

Mathematica: a system for doing mathematics by computer (2nd ed.)

Least squares approximants on Gauss-Lobatto points: orthogonal polynomials and Moore-Penrose pseudo-inverse

MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Gauss-Lobatto to Bernstein polynomials transformation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.