On the order of the Lebesgue constants for interpolation by algebraic polynomials from values at uniform nodes of a simplex (Q2388191)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the order of the Lebesgue constants for interpolation by algebraic polynomials from values at uniform nodes of a simplex |
scientific article |
Statements
On the order of the Lebesgue constants for interpolation by algebraic polynomials from values at uniform nodes of a simplex (English)
0 references
8 September 2005
0 references
Suppose that \(\Delta\subset\mathbb{R}^m\) is a nondegenerate \(m\)-simplex, \(\lambda= (\lambda_1,\dots, \lambda_{m+1})\in\mathbb{R}^{m+1}\) are barycentric coordinates of a point of the simplex, \(u(\lambda)\in \Delta\) is the point having the barycentric coordinates \((\lambda_1,\dots, \lambda_{m+i})\), and \(\{a_{i_1 i_2}\cdots i_{m+1}\}\) are the nodes of a uniform grid on the simplex, i.e., the nodes having the following barycentric coordinates: \[ a_{i_1 i_2}\cdots i_{m+1}= \biggl({i_1\over n}, {i_2\over n},\dots, {i_{m+ 1}\over n}\biggr),\quad i_k\in \{0,\dots, n\},\;i_1+ i_2+\cdots+ i_{m+1}= n.\tag{1} \] By \(L^m_n(\lambda)= L^m_n(\lambda_1,\dots, \lambda_{m+1})\) we denote the Lebesgue function of the Lagrangian process of interpolation of a function \(f\in C(\Delta)\) by algebraic polynomials of total degree at most \(n\) at the nodes of the uniform grid (1). By \(L^m_n\) we denote the Lebesgue constant of the interpolation process described above, and by \(I\) the set of multi-indices: \[ I= \{i= (i_1,\dots, i_{m+1})\mid i\in\mathbb{Z}^{m+1}_+,|i|= i_1+\cdots+ i_{m+1}= n\}. \] Suppose that \(\ell_i(\lambda)\), \(i\in I\), are fundamental polynomials, i.e., polynomials of total degree \(n\) in the variables \(\lambda_1,\dots, \lambda_{m+1}\) such that if \(a_j\), \(j\in I\), is the interpolation node (1), then \(\ell_i(a_j)= \delta^j_i\), where \(\delta^j_i= \delta^{j_1}_{i_1}\cdots\delta^{j_{m+1}}_{i_{m+1}}\) and \(\delta^{j_k}_{i_k}\) is the Kronecker delta. Then \(L^m_n(\lambda)= \sum_{i\in I} |\ell_i(\lambda)|\). It is well-known that \(L^m_n= \max_{\lambda: u(\lambda)\in\Delta} L^m_n(\lambda)\). The goal of the paper is to find the order of growth of the Lebesgue constants in \(n\) for \(m\geq 2\). We have the following Theorem. For the Lebesgue interpolation constant from values at uniform nodes on an \(m\)-simplex the following estimate holds: \[ c_1 {2^n\over n\ln n}\leq L^m_n\leq c_2(m){2^n\over n\ln n}, \] where \(c_1\) is an absolute constant and \(c_2(m)\) may depend on \(m\).
0 references
polynomial interpolation
0 references
Lebesgue constants
0 references
\(m\)-simplex
0 references
barycentric coordinates
0 references
Lagrangian interpolation process
0 references
fundamental polynomial
0 references