Methods with prefixed order for approximating square roots with global and general convergence
From MaRDI portal
Publication:990680
Recommendations
Cites work
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 894522 (Why is no real title available?)
- Accelerated convergence in Newton's method for approximating square roots
- Algorithms for \(n\)-th root approximation.
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- Families of rational maps and iterative root-finding algorithms
- Globally convergent algorithm for solving nonlinear equations
- Graphic and numerical comparison between iterative methods
- Indices of convexity and concavity. Application to Halley method
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- New methods for approximating square roots
- On Halley's Iteration Method
- On the efficiency of algorithms of analysis
- Semilocal convergence results for Newton-like methods using Kantorovich quasi-majorant functions involving the first derivative
- The components of a Julia set
Cited in
(4)
This page was built for publication: Methods with prefixed order for approximating square roots with global and general convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990680)