The authors describe a derivative-free class of iterative methods for the solution of equations with certain types of entire functions. There is a discussion of global convergence properties but no numerical example.
Recommendations
- scientific article; zbMATH DE number 3705796
- Multiple root-finding methods
- A method for determining the roots of some classes of equations with analytic functions and its applications
- scientific article; zbMATH DE number 1179336
- A steffensen-type method for computing a root
- scientific article; zbMATH DE number 794403
- A new family of methods for single and multiple roots
- Locating roots of a certain class of polynomials
- Point estimation of root finding methods
Cites work
- A family of root finding methods
- An automatic search procedure for finding real zeros
- scientific article; zbMATH DE number 3911587 (Why is no real title available?)
- scientific article; zbMATH DE number 3921832 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3437482 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- On the global convergence of Halley's iteration formula
- The Incrementation Parameter in Square Root Iteration
Cited in
(3)
This page was built for publication: A class of root finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123545)
