Abstract. Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abscissas. This note gives recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial. The latter opera...

Formulas are given for n-point osculatory and hyperosculatory (as well as ordinary) polynomial interpolation for f(x), over ( —1, 1), in terms of fixi), f'(xi) and f"(x/) at the irregularly-spaced Chebyshev points x¡ = —cos {(2i — l)ir/2n}, i = 1, • • ■ , n. The advantage over corresponding formulas for Xi equally spaced is in the squaring and cubing, in the respective osculatory and hyperoscul...

Digital images are widely used in computer applications. To store or transmit the uncompressed images requires considerable storage capacity and transmission bandwidth. Image compression is a means to perform transmission or storage of visual data in the most economical way. This paper explains about how images can be encoded to be transmitted in a multiplexing time-frequency domain channel. Mu...

The Hosoya polynomial triangle is a triangular arrangement of polynomials where each entry is a product of two polynomials. The geometry of this triangle is a good 1 tool to study the algebraic properties of polynomial products. In particular, we find closed formulas for the alternating sum of products of polynomials such as Fibonacci polynomials, Chebyshev polynomials, Morgan-Voyce polynomials...

In this paper, we propose to replace the Chebyshev series used in pseudospectral methods with the equivalent Chebyshev economized power series that can be evaluated more rapidly. We keep the rest of the implementation the same as the spectral method so that there is no new mathematical principle involved. We show by numerical examples that the new approach works well and there is indeed no sign...

Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial e...

In this study, we describe an algorithm that computes the degree of a Dickson Polynomial First Kind from its known value at point. Our is based on mathematical relation between Polynomials and Chebyshev Kind.

The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...

We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...

Let F be an algebraically closed field of characteristic 0 and f(x) a polynomial of degree strictly greater than one in F [x]. We show that the number of degree k polynomials with coefficients in F that commute with f (under composition) is either zero or equal to the number of degree one polynomials with coefficients in F that commute with f . As a corollary, we obtain a theorem of E. A. Bertr...