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

DOI10.1007/S11075-018-0641-9MaRDI QIDQ2334816zbMATH OpenOpenAlexWikidataFDO

Authors 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

Laguerre's methodmathematical softwarepolynomial roots

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(4)

• A combined method for polynomial roots using modified Newton-Raphson with minimum searching
• scientific article; zbMATH DE number 5307160 (Why is no real title available?)
• Root isolation methods based upon lagrangian interpolation
• Repellers for the Laguerre Iteration Function

Describes a project that uses

Uses Software

• mctoolbox
• na10
• NAG
• MPFUN

This page was built for publication: An effective implementation of a modified Laguerre method for the roots of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334816)