Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
From MaRDI portal
Publication:1372037
DOI10.1016/S0377-0427(97)00077-0zbMath0888.65058MaRDI QIDQ1372037
Masao Igarashi, Tjalling J. Ypma
Publication date: 4 June 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
zeros of polynomials; Newton-Raphson method; polynomial equation; multiple zeros; asymptotic rate of convergence; clustered zeros; Halley's square-root free method
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
Related Items
How Many Steps Still Left to $x$*?, A study of accelerated Newton methods for multiple polynomial roots, A survey on the high convergence orders and computational convergence orders of sequences
Cites Work
- Unnamed Item
- Unnamed Item
- A family of root finding methods
- A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
- Accelerated Convergence in Newton’s Method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation