An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli

DOI10.1134/S008154381303005XMaRDI QIDQ2447014zbMATH OpenFDO

Authors Herbert Möller

Publication date 23 April 2014

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial roots

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3909639
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• On solving algebraic equations of infinite degree with the help of a generalized Bernoulli method
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently
• The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots

Cites work

• scientific article; zbMATH DE number 4171064 (Why is no real title available?)
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Improvement on the Lehmer-Schur root detection method
• Principles for Testing Polynomial Zerofinding Programs
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence

Cited in

(3)

• On solving algebraic equations of infinite degree with the help of a generalized Bernoulli method
• The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots
• scientific article; zbMATH DE number 3928212 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPAViews
• Maple

This page was built for publication: An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli

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