Chebyshev-like root-finding methods with accelerated convergence
DOI10.1002/nla.661zbMath1224.65125MaRDI QIDQ3011656
Miodrag S. Petković, Ljiljana D. Petković, Lidija Z. Rančić, Snežana Ilić
Publication date: 29 June 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.661
iterative methods; computational efficiency; polynomial zeros; initial condition; complex zeros; acceleration of convergence; Chebyshev's method; Halley's corrections; Gauss-Seidel approach; simultaneous method; Newton's correction; single-step methods; multiple zeroes
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
65H04: Numerical computation of roots of polynomial equations
Related Items
Cites Work
- Unnamed Item
- Numerical methods for roots of polynomials. Part I
- A family of root finding methods
- Safe convergence of simultaneous methods for polynomial zeros
- A bibliography on roots of polynomials
- Iterative methods for simultaneous inclusion of polynomial zeros
- On some simultaneous methods based on Weierstrass' correction
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Computational efficiency of some combined methods for polynomial equations
- The fundamental theorem of algebra and complexity theory
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Point estimation of simultaneous methods for solving polynomial equations: A survey
