Point estimation and some applications to iterative methods
From MaRDI portal
Publication:1387244
DOI10.1007/BF02510920zbMath0948.65049OpenAlexW1975544700MaRDI QIDQ1387244
Dragoslav Herceg, Miodrag S. Petković, Snežana Ilić
Publication date: 2 August 1998
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02510920
convergencezeros of polynomialsinterval arithmeticpoint estimationsimultaneous methodsNewton's correctioninclusion of zerosfourth-order Ehrlich-Aberth methodGargantini-Henrici interval method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey. II. ⋮ On the guaranteed convergence of the square-root iteration method ⋮ Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros ⋮ Enclosing clusters of zeros of polynomials ⋮ A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ A new fourth-order family of simultaneous methods for finding polynomial zeros ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey ⋮ Point estimation of a family of simultaneous zero-finding methods ⋮ On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- Weierstrass formula and zero-finding methods
- Initial approximations in Euler-Chebyshev's method
- The theory of Smale's point estimation and its applications
- On some methods for the simultaneous determination of polynomial zeros
- On initial conditions for the convergence of simultaneous root finding methods
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- A posteriori error bounds for the zeros of polynomials
- Circular arithmetic and the determination of polynomial zeros
- Zur iterativen Auflösung algebraischer Gleichungen
- 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
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
This page was built for publication: Point estimation and some applications to iterative methods
