Decomposition of perturbed Chebyshev polynomials (Q2479395): Difference between revisions

The aim of this paper is to study and characterize polynomial decomposition \(f_n=r\circ q\) of perturbed Chebyshev polynomials \(\{f_n\}\) defined by the recurrence \(f_0(x)=b,\,\, f_1(x)= x-c,\; \, f_{n+1}(x)= (x-d)f_n(x)-a f_{n-1}(x),\; n \geq 1\), where \(a,b,c,d \in \mathbb{R}\) and \(a>0\). These polynomials generalize the monic Chebyshev polynomials of the first kind \(t_n(x)\) and the Chebyshev polynomials of the second kind \(u_n(x)\), which are obtained for \(a=\frac{1}{4}, b= 2,c=0, d=0\) and \(a=\frac{1}{4}, b= 1,c=0, d=0\) respectively. The last part of the paper is devoted to provide two algorithms for polynomial decomposition. These algorithms are implemented by the computation of reduced Gröbner bases with Maple 10 and the computing time can be controlled by some precision parameter. Finally the concrete application to the perturbed Chebyshev polynomials is shown.