Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Pascal Giorgi Computer Science , 2010, DOI: 10.1109/TC.2011.110 Abstract: In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's multiplication scheme to improve upon the naive method but without being able to get rid of its quadratic complexity. In this paper, we extend their result by providing a reduction scheme which allows to multiply polynomial in Chebyshev basis by using algorithms from the monomial basis case and therefore get the same asymptotic complexity estimate. Our reduction allows to use any of these algorithms without converting polynomials input to monomial basis which therefore provide a more direct reduction scheme then the one using conversions. We also demonstrate that our reduction is efficient in practice, and even outperform the performance of the best known algorithm for Chebyshev basis when polynomials have large degree. Finally, we demonstrate a linear time equivalence between the polynomial multiplication problem under monomial basis and under Chebyshev basis.
 G. Dupont Mathematics , 2009, DOI: 10.1007/s10801-009-0198-8 Abstract: We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials arise in cluster algebras with principal coefficients associated to acyclic quivers of infinite representation types and equioriented Dynkin quivers of type \$\mathbb A\$. We also study their interactions with bases and especially canonically positive bases in affine cluster algebras.
 Igor Rivin Mathematics , 2003, Abstract: We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative.
 Igor Rivin Mathematics , 2003, Abstract: We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. We further show that a Central Limit Theorem holds for our polynomials.
 Mohammad A. AlQudah Mathematics , 2015, DOI: 10.3906/mat-1501-44 Abstract: We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the paper with some results concerning integrals of the generalized Chebyshev-II and Bernstein polynomials.
 Mathematics , 2012, Abstract: In this paper, we derive some new and interesting idebtities for Bernoulli, Euler and Hermite polynomials associated with Chebyshev polynomials.
 Physics , 2003, Abstract: We define the coherent states for the oscillator-like systems, connected with the Chebyshev polynomials \$T_n(x)\$ and \$U_n(x)\$ of the 1-st and 2-nd kind.
 Johann Cigler Mathematics , 2012, Abstract: In this overview paper a direct approach to q-Chebyshev polynomials and their elementary properties is given. Special emphasis is placed on analogies with the classical case. There are also some connections with q-tangent and q-Genocchi numbers.
 Pawe？ J. Szab？owski Mathematics , 2015, Abstract: We expand some, mostly nonnegative rational functions of one or two variables in the series of Chebyshev polynomials. If such a series is multiplied by the density that makes Chebyshev polynomials orthogonal then we obtain Fourier series expansion of certain probabilistic density in the case of rational function of one variable or Lancaster expansion in the case of function of two variables. We study also the general case of rational function of order n depending (symmetrically) on n parameters and find (at least theoretical) expansion
 Mathematics , 2000, Abstract: We study generating functions for the number of permutations in \$\SS_n\$ subject to two restrictions. One of the restrictions belongs to \$\SS_3\$, while the other to \$\SS_k\$. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
 Page 1 /100 Display every page 5 10 20 Item