Related papers: Computing Chebyshev polynomials using the complex …

In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

We show that product Chebyshev polynomial meshes can be used, in a fully discrete way, to evaluate with rigorous error bounds the Lebesgue constant, i.e. the maximum of the Lebesgue function, for a class of polynomial projectors on cube,…

Odd degree Chebyshev polynomials over a ring of modulo $2^w$ have two kinds of period. One is an "orbital period". Odd degree Chebyshev polynomials are bijection over the ring. Therefore, when an odd degree Chebyshev polynomial iterate…

This research is concerned with finding the roots of a function in an interval using Chebyshev Interpolation. Numerical results of Chebyshev Interpolation are presented to show that this is a powerful way to simultaneously calculate all the…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

We establish a new extremal property of the classical Chebyshev polynomials in the context of best rank-one approximation of tensors. We also give some necessary conditions for a tensor to be a minimizer of the ratio of spectral and…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…

One of the purposes in this paper is to provide a better understanding of the alternance property which occurs in Chebyshev polynomial approximation and piecewise polynomial approximation problems. In the first part of this paper, we…

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…

The Boubaker polynomials are investigated in this paper. Using Riordan matrices analysis, a sequence of relations outlining the relations with Chebyshev and Fermat polynomials have been obtained. The obtained expressions are a meaningful…

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…

Polynomial series approximations are a central theme in approximation theory due to their utility in an abundance of numerical applications. The two types of series, which are featured most prominently, are Taylor series expansions and…

We propose an implementation of the Smooth Selection Embedding Method (SSEM) in the setting of Chebyshev polynomials. The SSEM is a hybrid fictitious domain / collocation method which solves boundary value problems in complex domains by…

The floating-point implementation of a function on an interval often reduces to polynomial approximation, the polynomial being typically provided by Remez algorithm. However, the floating-point evaluation of a Remez polynomial sometimes…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

The personalized PageRank algorithm is one of the most versatile tools for the analysis of networks. In spite of its ubiquity, maintaining personalized PageRank vectors when the underlying network constantly evolves is still a challenging…

The higher derivatives of the tangent and hyperbolic tangent functions are determined. Formulas for the higher derivatives of the inverse tangent and inverse hyperbolic tangent functions as polynomials are stated and proved. Using another…