Title :
On fast evaluation of bivariate polynomials at equispaced arguments
Author :
Roy, S. C Dutta ; Minocha, Shailey
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India
fDate :
7/1/1992 12:00:00 AM
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)
Keywords :
computational complexity; polynomials; signal processing; 2D bivariate polynomial evaluation; Bose´s recursive algorithm; computational complexity; equispaced arguments; initial value problem; recursive evaluation; signal processing; Algorithm design and analysis; Digital signal processing; Equations; Least squares methods; Maximum likelihood estimation; Parameter estimation; Polynomials; Signal processing algorithms; Spectral analysis; Speech processing;
Journal_Title :
Signal Processing, IEEE Transactions on
