Related papers: Chebyshev Interpolation for Function in 1D
The Julia set of the Chebyshev's method applied to polynomials with exactly two distinct roots is shown to be connected, and its Fatou set is proved to be the union of attracting basins corresponding to the two roots. Further, if the two…
We present a numerical spectral method to solve systems of differential equations on an infinite interval $y\in (-\infty, \infty)$ in presence of linear differential operators of the form $Q(y) \left(\partial/\partial_y\right)^b$ (where…
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is…
A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…
Double parton distributions are the nonperturbative ingredients needed for computing double parton scattering processes in hadron-hadron collisions. They describe a variety of correlations between two partons in a hadron and depend on a…
Digital architectures for Chebyshev interpolation are explored and a variation which is word-serial in nature is proposed. These architectures are contrasted with equispaced system structures. Further, Chebyshev interpolation scheme is…
We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values for the variable when $\le E$ of the evaluations can be erroneous. Our algorithms perform exact arithmetic in…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
We show that interpolation results in the $S$-nodes theory may be considered as Khrushchev-type formulas. If separation of the well-known Verblunsky (Schur) coefficients occurs in Khrushchev formulas, the separation of the so the called new…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
In this paper, using generalized k-fractional integral operator (in terms of the Gauss hypergeometric function), we establish new results on generalized k-fractional integral inequalities by considering the extended Chebyshev functional in…
We analyze decay of Chebyshev coefficients and local Chebyshev approximations for functions of finite regularity on finite intervals, focusing on the framework where the interval length tends to zero while the number of approximation nodes…
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these…
This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function…
In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…
The purpose of this note is to extend in a simple and unified way some results on orthogonal polynomials with respect to the weight function $$\frac{|T_m(x)|^p}{\sqrt{1-x^2}}\;,\quad-1<x<1\;,$$ where $T_m$ is the Chebyshev polynomial of the…
This note comprises a synthesis of certain results in the theory of exact interpolation between Hilbert spaces. In particular, we examine various characterizations of interpolation spaces and their relations to a number of results in…