Dutta Roy, S. C. ; Minocha, S. (1992) On fast evaluation of bivariate polynomials at equispaced arguments IEEE Transactions on Signal Processing, 40 (7). pp. 1813-1816. ISSN 1053-587X
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnum...
Related URL: http://dx.doi.org/10.1109/78.143452
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: | Article |
|---|---|
| Source: | Copyright of this article belongs to IEEE. |
| ID Code: | 92578 |
| Deposited On: | 01 Jun 2012 12:19 |
| Last Modified: | 01 Jun 2012 12:19 |
Repository Staff Only: item control page
