An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
From MaRDI portal
Publication:2447014
DOI10.1134/S008154381303005XzbMath1369.30004MaRDI QIDQ2447014
Publication date: 23 April 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials and rational functions of one complex variable (30C10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Improvement on the Lehmer-Schur root detection method
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Principles for Testing Polynomial Zerofinding Programs
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
This page was built for publication: An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli