An accelerated version of Newton's method with convergence order 3+1
From MaRDI portal
Publication:2211076
DOI10.1016/J.RINAM.2019.100078zbMATH Open1453.65100OpenAlexW2982202856MaRDI QIDQ2211076FDOQ2211076
Authors: Trevor J. McDougall, Simon J. Wotherspoon, P. Barker 
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
Recommendations
- A simple modification of Newton's method to achieve convergence of order \(1+\sqrt 2\)
- Accelerated Convergence in Newton’s Method
- Some variant of Newton's method with third-order convergence.
- A modification of Newton method with convergence of order \(2 + \sqrt{6}\)
- Accelerated Convergence in Newton’s Method
Cites Work
- Some Fourth Order Multipoint Iterative Methods for Solving Equations
- A variant of Newton's method with accelerated third-order convergence
- A simple modification of Newton's method to achieve convergence of order \(1+\sqrt 2\)
- The improvements of modified Newton's method
- Some efficient fourth order multipoint methods for solving equations
- A modified Newton method for rootfinding with cubic convergence.
- A third-order family of Newton-like iteration methods for solving nonlinear equations
- Some high-order zero-finding methods using almost orthogonal polynomials
Cited In (3)
- 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
- The asymptotic error constant of leap-frogging Newton's method locating a simple real zero
This page was built for publication: An accelerated version of Newton's method with convergence order \(\sqrt{3}+1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211076)
