Efficient parallel rooting of complex polynomials on the unit circle
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.
- A parallel algorithm for finding roots of a complex polynomial
- Some parallel methods for polynomial root-finding
- A parallel algorithm for simple roots of polynomials
- scientific article; zbMATH DE number 880381
- On the parallel arithmetic complexity of the root-finding problem
- ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- On a family of parallel root-finding methods for generalized polynomials
- scientific article; zbMATH DE number 4064369
- Accelerated approximation of the complex roots of a univariate polynomial
This page was built for publication: Efficient parallel rooting of complex polynomials on the unit circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987283)