Absoluteness of Jonsson Cardinals.pdfVIP

MATHEMATICS OF COMPUTATION Volume 68, Number 227, Pages 1109–1120 S 0025-5718(99)01070-4 Article electronically published on February 19, 1999 EXPONENTIAL CONVERGENCE OF A LINEAR RATIONAL INTERPOLANT BETWEEN TRANSFORMED CHEBYSHEV POINTS RICHARD BALTENSPERGER, JEAN-PAUL BERRUT, AND BENJAMIN NOE?L Abstract. In 1988 the second author presented experimentally well-condi- tioned linear rational functions for global interpolation. We give here arrays of nodes for which one of these interpolants converges exponentially for analytic functions Introduction Let f be a complex function defined on an interval I of the real axis and let x0, x1, . . . , xn be n + 1 distinct points of I, which we do not assume equidistant or ordered. Let fk := f(xk), k = 0(1)n. Then Pn[f ](x) := n∑ k=0 fkLk(x), Lk(x) := n∏ j=0,j 6=k x? xj xk ? xj ,(1) is the Lagrangian representation of the unique polynomial of degree at most n interpolating f between the points xk, k = 0(1)n. Introducing the notations [Sch] λk := 1∏ j 6=k (xk ? xj) , k = 0(1)n,(2) and L(x) := (x? x0)(x ? x1) · · · (x? xn),(3) we can rewrite (1) as Pn[f ](x) = L(x) n∑ k=0 λk x? xk fk.(4) Pn[f ] can also be written in its barycentric form by making use of the relation 1 = L(x) n∑ k=0 λk x? xk .(5) Received by the editor February 10, 1998. 1991 Mathematics Subject Classification. Primary 65D05, 41A20, 41A25. Key words and phrases. Interpolation, rational interpolation, linear interpolation, exponential convergence. c?1999 American Mathematical Society 1109 1110 RICHARD BALTENSPERGER, JEAN-PAUL BERRUT, AND BENJAMIN NOE?L Indeed, dividing (4) by (5) we obtain Pn[f ](x) = n∑ k=0 λk x? xk fk n∑ k=0 λk x? xk ,(6) which is one of the most stable formulas for evaluating Pn[f ] [Hen, Ber1]. For several arrays of points the λk (which are called weights of the barycentric formula) can be simplified. For example, for the Chebyshev points of the first kind xk := cos(φk), φk := 2k + 1 n + 1 π 2 , k = 0(1)n,(7) Pn[f ] becomes Pn[f ](x) = n∑ k=0 (