A higher order family for the simultaneous inclusion of multiple zeros of polynomials
DOI10.1007/S11075-004-8199-0zbMATH Open1104.65049OpenAlexW2004264715MaRDI QIDQ2501236FDOQ2501236
M. S. Petković, D. M. Milošević
Publication date: 4 September 2006
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-004-8199-0
convergencenumerical resultsiterative methodsinterval analysissimultaneous methodszeros of polynomialscircular arithmeticinclusion of zerosHalley-like methodmultiple complex zeros
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) Algorithms with automatic result verification (65G20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Parallel Laguerre iterations: The complex case
- Halley-like method with corrections for the inclusion of polynomial zeros
- On locating clusters of zeros of analytic functions
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Ten methods to bound multiple roots of polynomials
- Detection and validation of clusters of polynomial zeros
- Weierstrass formula and zero-finding methods
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- 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
- Finding a cluster of zeros of univariate polynomials
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- A modification of Newton's method for analytic mappings having multiple zeros
- Enclosing clusters of zeros of polynomials
- An Existence Test for Root Clusters and Multiple Roots
- Ostrowski-like method with corrections for the inclusion of polynomial zeros
- On the simultaneous determination of zeros of analytic or sectionally analytic functions
- A computational test for the existence of a polynomial zero
- A verified method for bounding clusters of zeros of analytic functions
- Family of simultaneous methods of Hansen--Patrick's type
- Improving the Van de Vel root-finding method
Cited In (9)
- A new higher-order family of inclusion zero-finding methods
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- On the convergence of the sequences of Gerschgorin-like disks
- A family of root-finding methods with accelerated convergence
- Sigmoid-like functions and root finding methods
- On new higher order families of simultaneous methods for finding polynomial zeros
- A posteriori error bound methods for the inclusion of polynomial zeros
- High order Euler-like method for the inclusion of polynomial zeros
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
Uses Software
This page was built for publication: A higher order family for the simultaneous inclusion of multiple zeros of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501236)
