Evaluating Polynomials at Fixed Sets of Points
- 1 December 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (4) , 533-539
- https://doi.org/10.1137/0204045
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new upper bound on the complexity of derivative evaluationInformation Processing Letters, 1974
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its DerivativesJournal of the ACM, 1974
- Discrete representation of signalsProceedings of the IEEE, 1972
- Computation of spectra with unequal resolution using the fast Fourier transformProceedings of the IEEE, 1971
- A linear filtering approach to the computation of discrete Fourier transformIEEE Transactions on Audio and Electroacoustics, 1970
- The Chirp z-Transform Algorithm and Its ApplicationBell System Technical Journal, 1969
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965