The Laguerre method for finding the zeros of polynomials

DOI10.1109/31.41294zbMath0695.65027OpenAlexW2072749727MaRDI QIDQ3471636

H. J. Orchard

Publication date: 1989

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

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

zbMATH Keywords

numerical experimentszeros of polynomialsnetwork designcubic convergencesmooth functionsLaguerre method

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) Real polynomials: location of zeros (26C10)

Related Items (2)

An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros ⋮ Repellers for the Laguerre Iteration Function

This page was built for publication: The Laguerre method for finding the zeros of polynomials