Some modifications of Laguerre's method

DOI10.1007/BF01933450zbMath0386.65013MaRDI QIDQ4167477

No author found.

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65H05: Numerical computation of solutions to single equations

Related Items

Higher-order simultaneous methods for the determination of polynomial multiple zeros, The computation of multiple roots of a polynomial, New progress in real and complex polynomial root-finding, The guaranteed convergence of Laguerre-like method, Numerical computation of polynomial zeros by means of Aberth's method, Chebyshev-Halley methods for analytic functions, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, A parallel Wilf algorithm for complex zeros of a polynomial, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, A hybrid Laguerre method, Laguerre-like inclusion method for polynomial zeros, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Structured matrix methods for the computation of multiple roots of a polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating the multiplicity of a root
• A family of root finding methods
• Simultaneous inclusion of the zeros of a polynomial
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• Laguerre's Method Applied to the Matrix Eigenvalue Problem