Fundamental Computations with Polynomials
作者： Dario Bini , Victor Y Pan , Dario Bini , Victor Y Pan , None
DOI: 10.1007/978-1-4612-0265-3_1
关键词: Formal power series 、 Line (geometry) 、 Algorithm 、 Padé approximant 、 Convolution 、 Discrete Fourier transform 、 Polynomial 、 Fast Fourier transform 、 Computer science 、 Algorithm design
摘要: In this chapter we recall the known effective algorithms for major problems of polynomial computations and demonstrate some fundamental techniques algorithm design, according to following line: first fast Fourier transform (FFT), leading a dramatic improvement classical discrete (DFT) multiplication (also called convolution). Then systematically extend such an other computations.
springer.com
springerlink.com参考文章(0)