On a cubically convergent derivative-free root finding method
From MaRDI portal
Recommendations
- On the convergence of the third order root-solver
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- A family of root-finding methods with accelerated convergence
- Chebyshev-like root-finding methods with accelerated convergence
Cites work
- A bibliography on roots of polynomials
- A family of simultaneous zero-finding methods
- A modified Newton method for polynomials
- A parallel algorithm for simple roots of polynomials
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Convergence of Newton’s method and inverse function theorem in Banach space
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Iterative methods for simultaneous inclusion of polynomial zeros
- On Euler-like methods for the simultaneous approximation 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
- On the convergence of the sequences of Gerschgorin-like disks
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Safe convergence of simultaneous methods for polynomial zeros
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
- The fundamental theorem of algebra and complexity theory
- The theory of Smale's point estimation and its applications
Cited in
(12)- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
- On the cubic convergence of the Paardekooper method
- Approximation of the smallest root of a cubic equation
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- scientific article; zbMATH DE number 6451405 (Why is no real title available?)
- On the convergence of the third order root-solver
- Quadratically convergent multiple roots finding method without derivatives
- Development of cubically convergent iterative derivative free methods for computing multiple roots
- A novel cubically convergent iterative method for computing complex roots of nonlinear equations
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
- On the convergence of the sequences of Gerschgorin-like disks
This page was built for publication: On a cubically convergent derivative-free root finding method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5297941)
