An improved upper bound on the Lebesgue constant of Berrut's rational interpolation operator (Q2252736)

From MaRDI portal





scientific article; zbMATH DE number 6319698
Language Label Description Also known as
default for all languages
No label defined
    English
    An improved upper bound on the Lebesgue constant of Berrut's rational interpolation operator
    scientific article; zbMATH DE number 6319698

      Statements

      An improved upper bound on the Lebesgue constant of Berrut's rational interpolation operator (English)
      0 references
      0 references
      23 July 2014
      0 references
      \textit{J.-P. Berrut} [Comput. Math. Appl. 15, No. 1, 1--16 (1988; Zbl 0646.65006)] introduced rational interpolants \(p_n\) to a function \(f\) at the nodes \(x_0, \ldots, x_n\) in the barycentric form \[ p_n[f] (x) = \left.\sum_{j=0}^n \frac{w_j}{x - x_j} f_j \right/ \sum_{j=0}^n \frac{w_j}{x - x_j}, \] where the weights were chosen to be \(w_j = (-1)^j\). For these weights and at equidistant nodes, [\textit{L. Bos} et al., J. Comput. Appl. Math. 236, No. 4, 504--510 (2011; Zbl 1231.41003)] showed that the Lebesgue constant \(\Gamma_n\) of Berrut's rational interpolation operator is bounded from above by \(2 + \ln(n)\). In this paper, this upper bound is improved to \[ \Gamma_n \leq \frac{1}{1 + \frac{\pi^2}{24}} \ln(n+1) + C_n, \] where for instance \(C_n \leq 1.47\) for \(n\geq 10\) and \(C_n \leq 1.00\) for \(n\geq 174\).
      0 references
      rational interpolation
      0 references
      Lebesgue constant
      0 references
      equidistant nodes
      0 references

      Identifiers