Efficient parallel rooting of complex polynomials on the unit circle (Q3987283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 31074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient parallel rooting of complex polynomials on the unit circle |
scientific article; zbMATH DE number 31074 |
Statements
Efficient parallel rooting of complex polynomials on the unit circle (English)
0 references
28 June 1992
0 references
covariance method
0 references
real-time high resolution
0 references
radar pulses
0 references
complex polynomial equation rooting problem
0 references
Möbius transformation
0 references
recursive method
0 references
Horner's method
0 references
computational efficiency
0 references
roundoff error propagation
0 references
0.9408372
0 references
0 references
0.9222657
0 references
0.90567577
0 references
0.9037365
0 references
0.90301347
0 references
0.9018159
0 references
The authors deal with the problem of real-time high resolution estimating of frequencies of certain radar pulses. By introducing the covariance method they translate this problem into a complex polynomial equation rooting problem. But in this case the roots of the corresponding polynomial are lying on a circle, thus after mapping it onto the real line by a suitable Möbius transformation \textit{A. H. Nuttall's} recursive method [IEEE Trans. Acoust. Speech Signal Process ASSP-35, No. 10, 1486-1487 (1987)] as well as Horner's method can be applied. After describing the algorithm in full detail the authors compare the methods of Nuttall and Horner in terms of computational efficiency. In addition investigations of roundoff error propagation effects seems to emphasize the advantage of the Nuttall recursive method.
0 references