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 polynomialsNewton-Raphson methodpolynomial equationmultiple zerosasymptotic rate of convergenceclustered zerosHalley's square-root free method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A survey on the high convergence orders and computational convergence orders of sequences ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ How Many Steps Still Left to $x$*?
Cites Work
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation