Asymptotic error constants of cubically convergent zero finding methods
From MaRDI portal
Recommendations
- A procedure for obtaining a family of iterative formulas for finding zeros of functions
- Hansen-Patrick's family is of Laguerre's type
- scientific article; zbMATH DE number 5606178
- A family of simultaneous zero-finding methods for polynomials
- A family of multiple root finding methods with cubical convergence
Cites work
- A family of root finding methods
- An optimal multiple root-finding method of order three
- Hansen-Patrick's family is of Laguerre's type
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3099313 (Why is no real title available?)
- On Halley's Iteration Method
Cited in
(9)- Convergence ball and error analysis of a family of iterative methods with cubic convergence
- On the convergence of Halley's method for multiple polynomial zeros
- A one parameter family of locally quartically convergent zero-finding methods
- The asymptotic error constant of leap-frogging Newton's method locating a simple real zero
- On Newton-type methods for multiple roots with cubic convergence
- On the convergence of Chebyshev's method for multiple polynomial zeros
- On a family of Laguerre methods to find multiple roots of nonlinear equations
- Hansen-Patrick's family is of Laguerre's type
- Chebyshev-Halley methods for analytic functions
This page was built for publication: Asymptotic error constants of cubically convergent zero finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503007)