An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
DOI10.1134/S008154381303005XzbMATH Open1369.30004MaRDI QIDQ2447014FDOQ2447014
Authors: Herbert Möller 
Publication date: 23 April 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
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
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)
Cites Work
- Improvement on the Lehmer-Schur root detection method
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Title not available (Why is that?)
- Principles for Testing Polynomial Zerofinding Programs
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
Cited In (3)
Uses Software
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)
