An accelerated version of Newton's method with convergence order \(\sqrt{3}+1\)
From MaRDI portal
Publication:2211076
DOI10.1016/j.rinam.2019.100078zbMath1453.65100OpenAlexW2982202856MaRDI QIDQ2211076
Trevor J. McDougall, Paul M. Barker, Simon J. Wotherspoon
Publication date: 10 November 2020
Published in: Results in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.rinam.2019.100078
Related Items
Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems ⋮ An efficient family of two-step with-memory methods with convergence order 6 and their dynamics
Cites Work
- Unnamed Item
- A modified Newton method for rootfinding with cubic convergence.
- A simple modification of Newton's method to achieve convergence of order \(1+\sqrt 2\)
- The improvements of modified Newton's method
- Some high-order zero-finding methods using almost orthogonal polynomials
- Some efficient fourth order multipoint methods for solving equations
- Some Fourth Order Multipoint Iterative Methods for Solving Equations
- A variant of Newton's method with accelerated third-order convergence