eprints
 

EPrints@IIT Delhi  >
Faculty Research Publicatons  >
Electrical Engineering >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2074/1724

Full metadata record

DC FieldValueLanguage
contributor.authorRoy, S C D-
contributor.authorMinocha, S-
date.accessioned2006-06-27T03:47:52Z-
date.available2006-06-27T03:47:52Z-
date.issued1992-
identifier.citationSignal Processing, IEEE Transactions on, 40(7), 1813 - 1816p.en
identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/1724-
description.abstractThe 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. Unbehauenen
format.extent54803 bytes-
format.mimetypeapplication/pdf-
language.isoenen
subjectrecursive evaluationen
subject2D polynomialen
titleOn fast evaluation of bivariate polynomials at equispaced argumentsen
typeArticleen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
royfas1992.pdf53KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

eprints@IIT Delhi Copyright  © 2004-2005 Powered by DSpace Software  - Feedback