Efficient parallel rooting of complex polynomials on the unit circle

DOI10.1109/78.91192MaRDI QIDQ3987283zbMATH OpenOpenAlexFDO

Authors William S. McCormick, James L. Lansford

Publication date 28 June 1992

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.91192

zbMATH Keywords

complex polynomial equation rooting problemcomputational efficiencycovariance methodHorner's methodMöbius transformationradar pulsesreal-time high resolutionrecursive methodroundoff error propagation

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

Recommendations

• 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

Cited in

(2)

• Accelerated approximation of the complex roots of a univariate polynomial
• A parallel algorithm for simple roots of polynomials

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)