On an efficient inclusion method for finding polynomial zeros
numerical examplesconvergence acceleration\(R\)-order of convergencecomputational efficiencyiterative methodpolynomial zerossimultaneous methodscircular interval arithmeticconvergence conditionsinclusion methodsHalley methodGauss-Seidel proceduresimple complex zerostwo-point correction
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04) Interval and finite arithmetic (65G30)
- Improved Halley-like methods for the inclusion of polynomial zeros
- Halley-like method with corrections for the inclusion of polynomial zeros
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- Efficient Halley-like methods for the inclusion of multiple zeros of polynomials
- Efficient methods for the inclusion of polynomial zeros
- scientific article; zbMATH DE number 3860295 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 1206066 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A note on \(Q\)-order of convergence
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Circular arithmetic and the determination of polynomial zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Halley-like method with corrections for the inclusion of polynomial zeros
- Improved Halley-like methods for the inclusion of polynomial zeros
- Iterative methods for simultaneous inclusion of polynomial zeros
- Modern computer arithmetic
- Multipoint methods for solving nonlinear equations: a survey
- Numerical methods for roots of polynomials. Part I
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- On an efficient family of simultaneous methods for finding polynomial multiple zeros
- On some applications of circular complex functions
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- The accelerated Halley-like method for the inclusion of polynomial zeros
- The numerical stability of simultaneous iterations via square-rooting
- The numerical stability of the generalised root iterations for polynomial zeros
- The accelerated Halley-like method for the inclusion of polynomial zeros
- scientific article; zbMATH DE number 1206073 (Why is no real title available?)
- A new higher-order family of inclusion zero-finding methods
- Improved Halley-like methods for the inclusion of polynomial zeros
- Efficient methods for the inclusion of polynomial zeros
- The improved square-root methods for the inclusion of multiple zeros of polynomials
- scientific article; zbMATH DE number 1904879 (Why is no real title available?)
- A method for finding zeros of polynomial equations using a contour integral based eigensolver
- Efficient Halley-like methods for the inclusion of multiple zeros of polynomials
- The self-validated method for polynomial zeros of high efficiency
This page was built for publication: On an efficient inclusion method for finding polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492088)