New higher-order methods for the simultaneous inclusion of polynomial zeros
DOI10.1007/S11075-011-9452-YzbMATH Open1231.65083OpenAlexW1984230032MaRDI QIDQ639989FDOQ639989
M. R. Milošević, M. S. Petković, D. M. Milošević
Publication date: 11 October 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-011-9452-y
Recommendations
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- Improved higher order method for the inclusion of multiple zeros of polynomials
- Improved methods for the simultaneous inclusion of multiple polynomial zeros
- On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros
- Laguerre-like methods for the simultaneous inclusion of multiple zeros of polynomials.
convergencenumerical exampleshigh-order methodspolynomial zerossimultaneous methodsinclusion methodsmultiple zeroscomplex zerosGargantini-Henrici's inclusion methodGauss-Seidel approach
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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)
Cites Work
- Fast multiplication of large numbers
- Modern Computer Arithmetic
- MPFR
- Numerical methods for roots of polynomials. Part I
- Iterative methods for simultaneous inclusion of polynomial zeros
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Circular arithmetic and the determination of polynomial zeros
- Title not available (Why is that?)
- Title not available (Why is that?)
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Title not available (Why is that?)
- A new fourth-order iterative method for finding multiple roots of nonlinear equations
- Weierstrass formula and zero-finding methods
- A method for finding the zeros of polynomials using a companion matrix.
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- Improved Halley-like methods for the inclusion of polynomial zeros
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- A modification of Newton's method for analytic mappings having multiple zeros
- Title not available (Why is that?)
- The self-validated method for polynomial zeros of high efficiency
- An Existence Test for Root Clusters and Multiple Roots
Cited In (3)
Uses Software
This page was built for publication: New higher-order methods for the simultaneous inclusion of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639989)