Abstract
Let\(\bar \Omega \) N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf :\(\bar \Omega \) N+2m → ℝ by algebraic polynomials on the grid Ω N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω N+m and Ω N , respectively, we construct a linear operatorY n+2m, N =Y n+2m, N (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω N ):
whereE n+m[g,l 2(Ω N+m )] is the best approximation of the function
by algebraic polynomials of degree at mostn+m in the spacel 2 (Ω N+m ) and the function Θ N, α (x) depends only on the weighted estimate for the Chebyshev polynomialsτ α,αk (x, N).
Similar content being viewed by others
References
I. I. Sharapudinov,Polynomials Orthogonal on Grids. Theory and Applications [in Russian], Izd. Dagestan Pedag. Univ., Makhachkala (1997).
S. Karlin and J. L. McGregor, “The Hahn polynomials, formulas and an application,”Scripta Math.,26, 33–46 (1961).
I. I. Sharapudinov, “The asymptotic properties and weighted estimates of the Chebyshev-Hahn polynomials,”Mat. Sb. [Math. USSR-Sb.],183, No. 3, 408–420 (1991).
G. Gasper, “Positivity and special functions,” in:Theory and Appl. Spec. Funct. (R. A. Askey, editor) (1975), pp. 375–433.
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 67, No. 3, pp. 460–470, March, 2000.
Rights and permissions
About this article
Cite this article
Sharapudinov, I.I. Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid. Math Notes 67, 389–397 (2000). https://doi.org/10.1007/BF02676675
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02676675