A new higher-order family of inclusion zero-finding methods
DOI10.1016/J.CAM.2004.12.020zbMATH Open1079.65059OpenAlexW2055925486MaRDI QIDQ557779FDOQ557779
Authors: M. S. Petković, D. M. Milošević 
Publication date: 30 June 2005
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.2004.12.020
Recommendations
- New higher-order methods for the simultaneous inclusion of polynomial zeros
- On new higher order families of simultaneous methods for finding polynomial zeros
- A family of simultaneous zero-finding methods
- A family of simultaneous zero finding methods
- Improved higher order method for the inclusion of multiple zeros of polynomials
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros
- A family of simultaneous zero-finding accelerated methods
- On an efficient inclusion method for finding polynomial zeros
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials
numerical examplesConvergenceAcceleration of convergenceCircular interval arithmeticInclusion methodsPolynomial zerosSimultaneous methods
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 solutions to single equations (65H05) Interval and finite arithmetic (65G30)
Cites Work
- Iterative methods for simultaneous inclusion of polynomial zeros
- Parallel Laguerre iterations: The complex case
- Halley-like method with corrections for the inclusion of polynomial zeros
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Circular arithmetic and the determination of polynomial zeros
- Title not available (Why is that?)
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- Title not available (Why is that?)
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- Efficient methods for the inclusion of polynomial zeros
- A family of root-finding methods with accelerated convergence
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials
- On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
- A new fourth-order family of simultaneous methods for finding polynomial zeros
This page was built for publication: A new higher-order family of inclusion zero-finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557779)
