A note on 'efficient evaluation of polynomials and exponentials of polynomials for equispaced arguments' by A.H. Nuttall

Roy, S. C. D. ; Minocha, S. (1991) A note on 'efficient evaluation of polynomials and exponentials of polynomials for equispaced arguments' by A.H. Nuttall IEEE Transactions on Signal Processing, 39 (11). pp. 2554-2556. ISSN 1053-587X

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/78.98013

Abstract

A.H. Nuttall's (see ibid., vol. ASSP-35, no.10, p.1486-7, 1987) algorithm for the evaluation of a polynomial at a large number of arguments is addressed. The authors supplement Nuttall's treatment of the problem by (1) giving a relationship between the coefficients of the original polynomial and those of the equivalent one in terms of the integer variable n and (2) by deriving a formula for the computation of the initial values required for Nuttall's recursive procedure to commence. As a result of these supplements, the recursive algorithm is completely programmable and can be efficiently implemented for any order N of the polynomial. Some general observations are made on the computational complexity in recursive evaluation in contrast to direct evaluation of a polynomial.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
Keywords:Computational Complexity; Equispaced Arguments; Exponentials of Polynomials; Recursive Algorithm; Signal Processing
ID Code:9902
Deposited On:02 Nov 2010 10:29
Last Modified:01 Jun 2011 11:30

Repository Staff Only: item control page