The Open UniversitySkip to content
 

On fast evaluation of bivariate polynomials at equispaced arguments

Roy, S. C. D. and Minocha, Shailey (1992). On fast evaluation of bivariate polynomials at equispaced arguments. IEEE Transactions on Signal Processing, 40(7) pp. 1813–1816.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1109/78.143452
Google Scholar: Look up in Google Scholar

Abstract

The initial value problem arising in the recursive evaluation of a 2D polynomial at equispaced points is treated in detail; the results facilitate efficient implementation of Bose's recursive algorithm. The computational complexity is compared with that involved in a direct computation, and some general observations are made for an alternative scheme proposed by X. Nie and R. Unbehauen (1989).

Item Type: Journal Article
Copyright Holders: 1992 IEEE
ISSN: 1053-587X
Keywords: computational complexity; polynomials; signal processing; equispaced arguments; Bose's recursive algorithm; 2D bivariate polynomial evaluation; DSP; Bose's recursive algorithm; initial value problem; recursive evaluation
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 21352
Depositing User: Shailey Minocha
Date Deposited: 26 May 2010 15:25
Last Modified: 02 Dec 2010 20:54
URI: http://oro.open.ac.uk/id/eprint/21352
Share this page:

Altmetrics

Scopus Citations

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk