|
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 Field | Value | Language |
| contributor.author | Roy, S C D | - |
| contributor.author | Minocha, S | - |
| date.accessioned | 2006-06-27T03:47:52Z | - |
| date.available | 2006-06-27T03:47:52Z | - |
| date.issued | 1992 | - |
| identifier.citation | Signal Processing, IEEE Transactions on, 40(7), 1813 - 1816p. | en |
| identifier.uri | http://eprint.iitd.ac.in/dspace/handle/2074/1724 | - |
| description.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 | en |
| format.extent | 54803 bytes | - |
| format.mimetype | application/pdf | - |
| language.iso | en | en |
| subject | recursive evaluation | en |
| subject | 2D polynomial | en |
| title | On fast evaluation of bivariate polynomials at equispaced arguments | en |
| type | Article | en |
| Appears in Collections: | Electrical Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
| royfas1992.pdf | | 53Kb | Adobe PDF | View/Open |
|
Show simple item record
All items in DSpace are protected by copyright, with all rights reserved.
|