Efficient parallel rooting of complex polynomials on the unit circle

DOI10.1109/78.91192zbMath0743.65046OpenAlexW2149544939MaRDI QIDQ3987283

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

computational efficiencyrecursive methodMöbius transformationHorner's methodroundoff error propagationcovariance methodcomplex polynomial equation rooting problemradar pulsesreal-time high resolution

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)

This page was built for publication: Efficient parallel rooting of complex polynomials on the unit circle