Some new properties of Chebyshev polynomials
type: Item
instance of: scholarly article
title: Some new properties of Chebyshev polynomials
zbMATH Open document ID: 1064.41019
DOI: 10.1016/S0377-0427(00)00271-5
author: G. Belforte
author: Paolo Gay
author: G. Monegato
published in: Journal of Computational and Applied Mathematics
publication date: 2001-01-01T00:00:00Z
review text: The paper deals with the problem of the selection of optimal nodes for polynomial interpolation of data subject to bounded perturbations. Let \(\tau=\{\tau_i\}\) be a set of nodes \(\tau\subset [t_a, t_b],\;1\leq i\leq n\), \(t_a\leq \tau_1<\tau_2<...<\tau_n\leq t_b\), and let \(\Pi_n\) be the set of the \((n-1)\)th-degree polynomial that assumes alternatively the values \(+1\) and \(-1\) at the nodes \(\tau_i\). Denote by \(\tau_{opt}\) the family of all extrema of the \((n-1)\)-degree first kind Chebyshev polynomial \(T_{n-1}\), shifted to the interval \((t_a, t_b)\). The following theorems are proved and applyed to the problem of the selection of optimal nodes. Theorem 1: For any \(t\notin [t_a, t_b]\) the minimym \(| P(t)| \), \(P\in \Pi_n\), is obtained for \(\tau=\tau_{opt}\). Theorem 2: The set nodes \(\tau_{opt}\) minimized also all derivatives \(| P^{(i)} (t)| \), \(P\in \Pi_n\), \(1\leq i\leq n-1\) at any \(t\notin [t_a, t_b]\). In connection with Theorem 1 it should be pointed out that in 1918 the following statement of Bernstein was published: Theorem: Let \(\pi_{n, \tau}\) be the set of \((n-1)\)-degree polynomial \(P\) satisfies the conditions \(| P(\tau_i)| \leq 1,\;\;1\leq i\leq n.\) Then for \([t_a, t_b]=[-1,1]\) and any \(t>1\) the \(\min_{\tau\subset [-1,1]} \max_{P\in \pi_{n, \tau}} | P(t)| \) is obtained for \(\tau=\tau_{opt}\) [see, for example, Math. Ann. 79, 1--12 (1918; JFM 46.0417.01) or Collected Works of S. N. Bernstein, Vol. 1. Akad. Nauk USSR (1952; Zbl 0047.07301), pp. 253--264].
reviewed by: Aleksey A. Dovgoshey
Mathematics Subject Classification ID: 41A50
Mathematics Subject Classification ID: 41A10
zbMATH DE Number: 1472305
zbMATH Keywords: Chebyshev polynomials
zbMATH Keywords: Interpolation
zbMATH Keywords: Optimal nodes
MaRDI profile type: Publication
cites work: Optimal sampling schedule for parameter estimation of linear models with unknown but bounded measurement errors
cites work: Q4810903
cites work: Q4333499
cites work: Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
cites work: Problems and results on the theory of interpolation. I
cites work: A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
cites work: Q3900444
cites work: Some new characterizations of the Chebyshev polynomials
cites work: Introduction to the constructive theory of functions
Recommended article: Best interpolation with polynomials lacking the linear term
Recommended article: An example of optimal nodes for interpolation
Recommended article: Q4537663
Recommended article: On an interpolation polynomial of S. N. Bernstein type
Recommended article: The use of the stochastic arithmetic to estimate the value of interpolation polynomial with optimal degree
Recommended article: Generalization of Polynomial Interpolation at Chebyshev Nodes
Recommended article: Q5748327
Recommended article: A modification of Lagrange interpolation
Recommended article: Zur Konvergenz der Ableitungen von Interpolationspolynomen
Recommended article: Inverse polynomial mappings and interpolation on several intervals
description: scientific article; zbMATH DE number 1472305