Related papers: Chebyshev Interpolation for Function in 1D
In this study linear and nonlinear higher order singularly perturbed problems are examined by a numerical approach, the differential quadrature method. Here, the main idea is using Chebyshev polynomials to acquire the weighting coefficient…
The spread between two lines in rational trigonometry replaces the concept of angle, allowing the complete specification of many geometrical and dynamical situations which have traditionally been viewed approximately. This paper…
We present a new algorithm for refining a real interval containing a single real root: the new method combines characteristics of the classical Bisection algorithm and Newton's Iteration. Our method exhibits quadratic convergence when…
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a…
The aim of this paper is to characterize universal and multiplier interpolating sequences for de Branges-Rovnyak spaces H (b) where the defining function b is a general non-extreme rational function. Our results carry over to recently…
The Hermite-Birkhoff interpolation problem of a function given on arbitrarily distributed points on the sphere and other manifolds is considered. Each proposed interpolant is expressed as a linear combination of basis functions, the…
This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…
In this present paper, I propose a derivation of unified interpolation and extrapolation function that predicts new values inside and outside the given range by expanding direct Taylor series on the middle point of given data set.…
Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of…
In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…
The Householder's method is a root-find algorithm which is a natural extension of the methods of Newton and Halley. The current paper mostly focuses on approximating the square root of a positive real number based on these methods. The…
It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…
This article explores the influence of evenly spaced data points on radial-basis-function interpolation.
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.
In order to solve Prandtl-type equations we propose a collocation-quadrature method based on VP filtered interpolation at Chebyshev nodes. Uniform convergence and stability are proved in a couple of Holder - Zygmund spaces of locally…
Histopolation, or interpolation on segments, is a mathematical technique used to approximate a function $f$ over a given interval $I=[a,b]$ by exploiting integral information over a set of subintervals of $I$. Unlike classical polynomial…
We propose a fast and stable method for constructing matrix approximations to fractional integral operators applied to series in the Chebyshev fractional polynomials. This method utilizes a recurrence relation satisfied by the fractional…
A Chebyshev-type quadrature for a given weight function is a quadrature formula with equal weights. In this work we show that a method presented by Kane may be used to produce tight bounds for the minimal number of nodes required in…
The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…