.png){kind=icon}
.png){kind=icon}
Return
A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2010.45.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a new method for multiplying polynomials in Chebyshev form. Our approach has two steps. First, the well-known Karatsuba's algorithm is applied to polynomials constructed by using Chebyshev coefficients. Then, from the obtained result, extra arithmetic operations are used to write the final result in Chebyshev form. The proposed algorithm has a quadratic computational complexity. We also compare our method to other approaches.
Keywords:
Theory of computation
analysis of algorithms and problem complexity
computations on polynomials
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K