Methods with prefixed order for approximating square roots with global and general convergence
From MaRDI portal
Publication:990680
DOI10.1016/J.AMC.2007.04.033zbMATH Open1193.65062OpenAlexW2075909279MaRDI QIDQ990680FDOQ990680
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.033
Recommendations
Iteration of real functions in one variable (26A18) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphic and numerical comparison between iterative methods
- Title not available (Why is that?)
- New methods for approximating square roots
- The components of a Julia set
- Families of rational maps and iterative root-finding algorithms
- On Halley's Iteration Method
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- On the efficiency of algorithms of analysis
- Indices of convexity and concavity. Application to Halley method
- Accelerated convergence in Newton's method for approximating square roots
- Globally convergent algorithm for solving nonlinear equations
- Algorithms for \(n\)-th root approximation.
- Semilocal convergence results for Newton-like methods using Kantorovich quasi-majorant functions involving the first derivative
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)
