On an efficient inclusion method for finding polynomial zeros
DOI10.1016/j.cam.2015.05.015zbMath1321.65078OpenAlexW619702142MaRDI QIDQ492088
Dušan M. Milošević, Mimica R. Milošević, Jovana Džunić
Publication date: 19 August 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.05.015
numerical examplesconvergence accelerationiterative methodcomputational efficiencypolynomial zeros\(R\)-order of convergencesimultaneous methodscircular interval arithmeticconvergence conditionsinclusion methodsHalley methodGauss-Seidel proceduresimple complex zerostwo-point correction
Interval and finite arithmetic (65G30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multipoint methods for solving nonlinear equations: a survey
- The numerical stability of the generalised root iterations for polynomial zeros
- Numerical methods for roots of polynomials. Part I
- On some applications of circular complex functions
- The numerical stability of simultaneous iterations via square-rooting
- Halley-like method with corrections for the inclusion of polynomial zeros
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- Iterative methods for simultaneous inclusion of polynomial zeros
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Circular arithmetic and the determination of polynomial zeros
- Improved Halley-like methods for the inclusion of polynomial zeros
- On an Efficient Family of Simultaneous Methods for Finding Polynomial Multiple Zeros
- Modern Computer Arithmetic
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- A note on \(Q\)-order of convergence
This page was built for publication: On an efficient inclusion method for finding polynomial zeros
