An effective implementation of a modified Laguerre method for the roots of a polynomial

DOI10.1007/s11075-018-0641-9OpenAlexW2904991178WikidataQ128699835 ScholiaQ128699835MaRDI QIDQ2334816

Thomas R. Cameron

Publication date: 8 November 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-018-0641-9

zbMATH Keywords

mathematical softwarepolynomial rootsLaguerre's method

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04) Numerical analysis (65-XX)

Related Items

Repellers for the Laguerre Iteration Function

Uses Software

• NAG
• mctoolbox
• na10
• MPFUN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical computation of polynomial zeros by means of Aberth's method
• Laguerre's iteration and the method of traces for eigenproblems
• A family of simultaneous zero-finding methods
• Another efficient algorithm for convex hulls in two dimensions
• A family of root finding methods
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• The convergence of a family of parallel zero-finding methods
• A hybrid Laguerre method
• Solving secular and polynomial equations: a multiprecision algorithm
• A posteriori error bounds for the zeros of polynomials
• Zur iterativen Auflösung algebraischer Gleichungen
• Generalizations of Laguerre’s Method: Higher Order Methods
• Principles for Testing Polynomial Zerofinding Programs
• Some modifications of Laguerre's method
• Remark on Algorithms to Find Roots of Polynomials
• Solving a Polynomial Equation: Some History and Recent Progress
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On Laguerre's Method
• Accuracy and Stability of Numerical Algorithms
• Lectures on Finite Precision Computations
• Fast and Backward Stable Computation of Roots of Polynomials
• Laguerre's Method Applied to the Matrix Eigenvalue Problem
• A modified Newton method for polynomials
• Laguere’s Method and a Circle which Contains at Least One Zero of a Polynomial
• LR algorithm with Laguerre shift for symmetric tridiagonal matrices