×
Copy the page URI to the clipboard
Roy, S. C. D. and Minocha, Shailey
(1992).
DOI: https://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).