Related papers: Chebyshev Interpolation for Function in 1D
A family of exact upper bounds interpolating between Chebyshev's and Cantelli's is presented.
It is known that there exists a function interpolating a given data set such that the graph of the function is the attractor of an iterated function system which is called fractal interpolation function. We generalize the notion of fractal…
In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.
We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" $I \subset \mathbb{F}_p$, provided $(p^{1/2}\log p)/|I| = o(1)$. Applications include…
The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…
We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…
Interpolation of classes of differentiated functions given on a finite interval by trigonometric splines using the phantom node method is considered. This method consists in supplementing a given sequence of values of an approximate…
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…
Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, DCT and IDST, respectively, together with the efficient evaluation of the modified moments by forwards recursions or by…
The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.
Given a sequence of real numbers, we consider its subsequences converging to possibly different limits and associate to each of them an index of convergence which depends on the density of the associated subsequences. This index turns out…
We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…
Chebyshev coefficients of a coordinate representation can be used to form the corresponding velocity representation. One way is to directly apply them to the derivatives of Chebyshev polynomials, another is to compute from them the…
We establish new connection formulae between Fibonacci polynomials and Chebyshev polynomials of the first and second kinds. These formulae are expressed in terms of certain values of hypergeometric functions of the type 2F1. Consequently,…
In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation…
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
An expansion procedure using third kind Chebyshev polynomials as base functions is suggested for solving second type Volterra integral equations with logarithmic kernels. The algorithm's convergence is studied and some illustrative examples…
This contribution presents a new analysis of properties of the interpolation using Radial Bases Functions (RBF) related to large data sets interpolation. The RBF application is convenient method for scattered d-dimensional interpolation.…