The theorem proved here extends Chebyshev theory into what has previously been no man's land: functions which have an infinite number of bounded derivatives on the expansion interval [a, b] but which are singular at one endpoint. The Chebyshev series in l/x for all the familiar special functions fall into this category, so this class of functions is very important indeed. In words, the theorem ...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

We present five theorems concerning the asymptotic convergence rates of Chebyshev interpolation applied to functions transplanted to either a semi-infinite or an infinite interval under exponential or double-exponential transformations. This strategy is useful for approximating and computing with functions that are analytic apart from endpoint singularities. The use of Chebyshev polynomials ins...

In this work we derive new alternatives for efficient computation of the matrix cosine. We focus especially on the two classes of normal and nonnegative matrices and we present intervals of applications for rational L∞ approximations of various degrees for these types of matrices in the lines of [3]. Our method relies on Remez algorithm for rational approximation while the innovation here is th...

We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings semifields idempotent addition. Given a set samples, each consisting input output an unknown function defined on semifield, problem is to find function, by Puiseux polynomial rational functions. A solution approach proposed, involves reduction approximate...

It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results show tha...

A new algorithm is proposed for polynomial or rational approximation of the planar offset curve. The best rational Chebyshev approximation could be regarded as a kind of geometric approximation along the fixed direction. Based on this idea, we developed a wholly new offset approximation method by changing the fixed direction to the normal directions. The error vectors follow the direction of no...

We construct an hyperinterpolation formula of degree n in the three-dimensional cube, by using the numerical cubature formula for the product Chebyshev measure given by the product of a (near) minimal formula in the square with Gauss-Chebyshev-Lobatto quadrature. The underlying function is sampled at N ∼ n/2 points, whereas the hyperinterpolation polynomial is determined by its (n + 1)(n + 2)(n...