Related papers: Chebyshev polynomials on symmetric matrices
This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…
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…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…
This short paper is concerned with polynomial Pell equations \[P^2-DQ^2=1,\] with $P,Q,D\in\Bbb C[X]$ and ${deg}(D)=2$. The main result shows that the polynomials $P$ and $Q$ are closely related to Chebyshev polynomials. We then investigate…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev-Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they…
We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…
We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…
We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…
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…
In this article the quantized matrix algebras as in the title have been studied at a root of unity. A full classification of simple modules over such quantized matrix algebras of rank $2$ along with a class of finite dimensional…
The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…
We explicitly determine the defining relations of all quantum symmetric pair coideal subalgebras of quantized enveloping algebras of Kac-Moody type. Our methods are based on star products on noncommutative $\mathbb{N}$-graded algebras. The…
There is a space of vector-valued nonsymmetric Jack polynomials associated with any irreducible representation of a symmetric group. Singular polynomials for the smallest singular values are constructed in terms of the Jack polynomials. The…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…
We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (\epsilon \leq |z| \leq1). We explain how rational approximations can be applied to large sparse…
In this paper we describe polynomials orthogonal to all powers of a Chebyshev polynomial on a segment.